22 search results - page 2 / 5 » A Novel Level-Based IPv6 Routing Lookup Algorithm |
ICOIN
2003
Springer
13 years 10 months ago
2003
Springer
Ternary content-addressable memory has been widely used to perform fast routing lookups. It is able to accomplish the best matching prefix problem in O(1) time without considering...
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...
AINA
2009
IEEE
13 years 11 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
NETWORKING
2008
13 years 6 months ago
2008
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
APNOMS
2006
Springer
13 years 8 months ago
2006
Springer
Peer-to-Peer systems are based on the concept of resources localization and mutualization in dynamic context. In specific environment such as mobile networks, characterized by high...