Sciweavers

85 search results - page 5 / 17
» Small Forwarding Tables for Fast Routing Lookups
Sort
View
AINA
2009
IEEE
14 years 1 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
SIGCOMM
1999
ACM
13 years 11 months ago
Routing with a Clue
We suggest a new simple forwarding technique to speed-up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IP...
Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled
MICRO
2003
IEEE
128views Hardware» more  MICRO 2003»
14 years 11 days ago
IPStash: a Power-Efficient Memory Architecture for IP-lookup
Abstract—High-speed routers often use commodity, fully-associative, TCAMs (Ternary Content Addressable Memories) to perform packet classification and routing (IP lookup). We prop...
Stefanos Kaxiras, Georgios Keramidas
INFOCOM
1998
IEEE
13 years 11 months ago
Routing Lookups in Hardware at Memory Access Speeds
Increased bandwidth in the Internet puts great demands on network routers; for example, to route minimum sized Gigabit Ethernet packets, an IP router must process about packets pe...
Pankaj Gupta, Steven Lin, Nick McKeown
AINA
2005
IEEE
14 years 22 days ago
Fast and Scalable Multi-TCAM Classification Engine for Wide Policy Table Lookup
With the explosive growth of Internet traffic, the next generation switches are designed to provide forwarding speed up to 10Gbps or above. To meet the challenges of delivering wi...
Nen-Fu Huang, Kwei-Bor Chen, Whai-En Chen