Sciweavers

Share
39 search results - page 1 / 8
» Constructing Optimal IP Routing Tables
Sort
View
INFOCOM
1999
IEEE
9 years 1 months ago
Constructing Optimal IP Routing Tables
Richard Draves, Christopher King, Venkatachary Sri...
CN
2007
97views more  CN 2007»
8 years 9 months ago
A longest prefix first search tree for IP lookup
- One of the key design issues for IP routers is the IP Lookup mechanism. IP lookup is an important action in router that is to find the next hop of each incoming packet with a lon...
Lih-Chyau Wuu, Tzong-Jye Liu, Kuo-Ming Chen
SIGCOMM
1997
ACM
9 years 1 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...
AINA
2009
IEEE
9 years 4 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
books