Sciweavers

51 search results - page 3 / 11
» High-performance IP routing table lookup
Sort
View
SIGCOMM
1997
ACM
13 years 9 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
14 years 4 days 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
GLOBECOM
2007
IEEE
13 years 11 months ago
Power Efficient IP Lookup with Supernode Caching
— In this paper, we propose a novel supernode caching scheme to reduce IP lookup latencies and energy consumption in network processors. In stead of using an expensive TCAM based...
Lu Peng, Wencheng Lu, Lide Duan
WEA
2007
Springer
97views Algorithms» more  WEA 2007»
13 years 11 months ago
Experimental Evaluations of Algorithms for IP Table Minimization
Abstract. The continuous growth of the routing tables sizes in backbone routers is one of the most compelling scaling problems affecting the Internet and has originated considerab...
Angelo Fanelli, Michele Flammini, Domenico Mango, ...
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
13 years 10 months ago
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ...
Filippo Geraci, Roberto Grossi