Sciweavers

9 search results - page 1 / 2
» A Dynamic Binary Hash Scheme for IPv6 Lookup
Sort
View
GLOBECOM
2008
IEEE
13 years 10 months ago
A Dynamic Binary Hash Scheme for IPv6 Lookup
Qiong Sun, Xiaohong Huang, Xiaoju Zhou, Yan Ma
SIGCOMM
1997
ACM
13 years 8 months ago
Scalable High Speed IP Routing Lookups
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...
Marcel Waldvogel, George Varghese, Jonathan S. Tur...
COMPSAC
2008
IEEE
13 years 10 months ago
Parallel Table Lookup for Next Generation Internet
The rapid growth of Internet population leads to the shortage of IP addresses. The next generation IP protocol, IPv6, which extends the IP address length from 32 bits to 128 bits,...
Li-Che Hung, Yaw-Chung Chen
INFOCOM
2007
IEEE
13 years 10 months ago
Tree, Segment Table, and Route Bucket: A Multi-Stage Algorithm for IPv6 Routing Table Lookup
—Next generation internet protocol, IPv6, has attracted growing attention and has been deploying worldwide. With 128-bit address, IPv6 provides an extremely large address space a...
Zhenqiang Li, Dongqu Zheng, Yan Ma
NETWORKING
2008
13 years 5 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
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...
Mohammad Behdadfar, Hossein Saidi