DocumentCode
2645702
Title
IP lookup in software for large routing tables using DMP-tree data structure
Author
Yazdani, Nasser ; Mohammadi, Hossein
Author_Institution
Dept. of ECE, Tehran Univ., Iran
Volume
3
fYear
2003
fDate
21-24 Sept. 2003
Firstpage
1172
Abstract
Making IP lookup fast and scalable is crucial in the Internet routers due to the fast increase in line speeds and routing table sizes. In this paper, we use DMP-Tree (dynamic M-way prefix tree) data structure to perform IP lookup in software. Experimental results show that our method is fast enough to support multi gigabit per second lines and it scales very well to routing tables with millions of entries. The proposed solution scales well to IPv6 with a reasonable overhead.
Keywords
Internet; table lookup; telecommunication network routing; transport protocols; tree data structures; IP lookup method; IPv6; Internet router; dynamic M-way prefix tree data structure; routing table; software; Clocks; Computer aided manufacturing; Data structures; Hardware; Internet; Laboratories; Routing; Scalability; Software performance; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2003. APCC 2003. The 9th Asia-Pacific Conference on
Print_ISBN
0-7803-8114-9
Type
conf
DOI
10.1109/APCC.2003.1274285
Filename
1274285
Link To Document