Sciweavers

Share
CN
2004

Multiway range trees: scalable IP lookup with fast updates

9 years 6 months ago
Multiway range trees: scalable IP lookup with fast updates
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is based on a new data structure, a multiway range tree. While existing lookup schemes are good for IPv4, they do not scale well in both lookup speed and update costs when addresses grow longer as in the IPv6 proposal. Thus our lookup scheme is the first lookup scheme to offer fast lookups and updates for IPv6 while remaining competitive for IPv4. The possibility of a global Internet with addressable appliances has motivated a proposal to move from the older Internet Ipv4 routing protocol with 32 bit addresses to a new protocol, IPv6 with 128 bit addresses. While there is uncertainty about IPv6, any future Internet protocol will require at least 64 bit, and possibly even 128 bit addresses as in IPv6. Thus for this paper we simply use IPv6 and 128 bits to refer to the next generation IP protocol and its address lengt...
Priyank Ramesh Warkhede, Subhash Suri, George Varg
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2004
Where CN
Authors Priyank Ramesh Warkhede, Subhash Suri, George Varghese
Comments (0)
books