Sciweavers

149 search results - page 3 / 30
» Routing Lookups in Hardware at Memory Access Speeds
Sort
View
COMCOM
2006
98views more  COMCOM 2006»
13 years 6 months ago
High-speed IP address lookup using balanced multi-way trees
Rapid growth of the Internet traffic requires more bandwidth and high-speed packet processing in the Internet routers. As one of the major packet processing performed in routers, ...
Hyesook Lim, Wonjung Kim, Bomi Lee, Changhoon Yim
MICRO
2003
IEEE
128views Hardware» more  MICRO 2003»
13 years 11 months 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
2005
IEEE
13 years 12 months ago
IPStash: a set-associative memory approach for efficient IP-lookup
—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased traffic, and higher speed links. These characteristics lead to the prevalence of hard...
Stefanos Kaxiras, Georgios Keramidas
ICCD
2004
IEEE
76views Hardware» more  ICCD 2004»
14 years 3 months ago
Technique to Eliminate Sorting in IP Packet Forwarding Devices
This paper will present a solution to eliminate the requirements of sorting by prefix length in IP forwarding devices using Ternary Content Addressable Memories (TCAMs). This will...
Raymond W. Baldwin, Enrico Ng
SIGCOMM
1997
ACM
13 years 10 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...