Sciweavers

165 search results - page 9 / 33
» Fast Routing Table Lookup Using CAMs
Sort
View
SIGCOMM
1997
ACM
15 years 2 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...
83
Voted
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
15 years 3 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
ISCAS
2006
IEEE
113views Hardware» more  ISCAS 2006»
15 years 4 months ago
High speed routing lookup IC design for IPv6
— With the growth of Internet users and services, the IP address has been exhausted. In order to solve this problem, the short term solution was presented, i.e., CIDR (Classless ...
Yuan-Sun Chu, Hui-Kai Su, Po-Feng Lin, Ming-Jen Ch...
92
Voted
INFOCOM
2002
IEEE
15 years 3 months ago
Efficient Hardware Architecture for Fast IP Address Lookup
 A multigigabit IP router may receive several millions packets per second from each input link. For each packet, the router needs to find the longest matching prefix in the forw...
Derek C. W. Pao, Angus Wu, Cutson Liu, Kwan Lawren...
126
Voted
ANCS
2009
ACM
14 years 8 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...