Sciweavers

16 search results - page 2 / 4
» Optimal Routing Table Design for IP Address Lookups Under Me...
Sort
View
ICPADS
2002
IEEE
13 years 8 months ago
Hardware-based IP Routing Lookup with Incremental Update
Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching ...
Pi-Chung Wang, Chia-Tai Chan, Shuo-Cheng Hu, Yu-Ch...
CONEXT
2006
ACM
13 years 9 months ago
Using forgetful routing to control BGP table size
Running the Border Gateway Protocol (BGP), the Internet’s interdomain routing protocol, consumes a large amount of memory. A BGP-speaking router typically stores one or more rou...
Elliott Karpilovsky, Jennifer Rexford
ICNP
2005
IEEE
13 years 9 months ago
Shape Shifting Tries for Faster IP Route Lookup
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
Haoyu Song, Jonathan S. Turner, John W. Lockwood
FPL
2008
Springer
107views Hardware» more  FPL 2008»
13 years 5 months ago
Scalable high-throughput SRAM-based architecture for IP-lookup using FPGA
Most high-speed Internet Protocol (IP) lookup implementations use tree traversal and pipelining. However, this approach results in inefficient memory utilization. Due to available...
Hoang Le, Weirong Jiang, Viktor K. Prasanna
INFOCOM
2002
IEEE
13 years 8 months ago
Scalable IP Lookup for Programmable Routers
Abstract— Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services...
David E. Taylor, John W. Lockwood, Todd S. Sproull...