11 search results - page 1 / 3 » Range Tries for scalable address lookup |
ANCS
2009
ACM
13 years 2 months ago
2009
ACM
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...
CN
2004
13 years 4 months ago
2004
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 base...
SIGCOMM
1997
ACM
13 years 9 months ago
1997
ACM
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP...
P2P
2005
IEEE
13 years 10 months ago
2005
IEEE
A resource directory is a critical component of a Grid architecture. P2P computing paradigm could address some of the scalability issues that make distributed resource discovery s...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
Currently, the increasing rate of routing lookups in Internet routers, the large number of prefixes and also the transition from IPV4 to IPV6, have caused Internet designers to pro...