Sciweavers

10 search results - page 1 / 2
» Parallel Search Trie-Based Scheme for Fast IP Lookup
Sort
View
GLOBECOM
2007
IEEE
13 years 10 months ago
Parallel Search Trie-Based Scheme for Fast IP Lookup
—As data rates in the Internet increase, the Internet Protocol (IP) address lookup is required to be resolved in shorter resolution times. IP address lookup involves finding the...
Roberto Rojas-Cessa, Lakshmi Ramesh, Ziqian Dong, ...
CIAC
2003
Springer
85views Algorithms» more  CIAC 2003»
13 years 9 months ago
XOR-Based Schemes for Fast Parallel IP Lookups
Gian Carlo Bongiovanni, Paolo Penna
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
CN
2004
148views more  CN 2004»
13 years 4 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 base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...
INFOCOM
1999
IEEE
13 years 8 months ago
High Performance IP Routing Table Lookup using CPU Caching
Wire-speed IP (Internet Protocol) routers require very fast routing table lookup for incoming IP packets. The routing table lookup operation is time consuming because the part of ...
Tzi-cker Chiueh, Prashant Pradhan