Sciweavers

53 search results - page 1 / 11
» A Fast IP Routing Lookup Scheme
Sort
View
ICC
2000
IEEE
124views Communications» more  ICC 2000»
14 years 1 days ago
A Fast IP Routing Lookup Scheme
Abstract—A major issue in router design for the next generation Internet is the fast IP address lookup mechanism. The existing scheme by Huang et al. performs the IP address look...
Pi-Chung Wang, Yaw-Chung Chen, Chia-Tai Chan
INFOCOM
1999
IEEE
13 years 12 months ago
A Fast IP Routing Lookup Scheme for Gigabit Switching Routers
One of the key design issues for the new generation IP routers is the route lookup mechanism. For each incoming IP packet, the IP routing requires to perform a longest prefix match...
Nen-Fu Huang, Shi-Ming Zhao, Jen-Yi Pan, Chi-An Su
INFOCOM
1999
IEEE
13 years 12 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
AINA
2009
IEEE
14 years 2 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—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...
Yeim-Kuan Chang, Yung-Chieh Lin
CN
2004
148views more  CN 2004»
13 years 7 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...