ACM Home Page
Please provide us with feedback. Feedback
Scalable high speed IP routing lookups
Full text PdfPdf (1.66 MB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication table of contents
Cannes, France
Pages: 25 - 36  
Year of Publication: 1997
ISBN:0-89791-905-X
Also published in ...
Authors
Marcel Waldvogel  Computer Engineering and Networks Laboratory, ETH Zürich, Switzerland
George Varghese  Computer and Communications Research Center, Washington University, St. Louis
Jon Turner  Computer and Communications Research Center, Washington University, St. Louis
Bernhard Plattner  Computer Engineering and Networks Laboratory, ETH Zürich, Switzerland
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 128,   Citation Count: 85
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/263105.263136
What is a DOI?

ABSTRACT

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 routing lookup requires computing the best matching prefix, for which standard solutions like hashing were believed to be inapplicable. The best existing solution we know of, BSD radix tries, scales badly as IP moves to 128 bit addresses. Our paper describes a new algorithm for best matching prefix using binary search on hash tables organized by prefix lengths. Our scheme scales very well as address and routing table sizes increase: independent of the table size, it requires a worst case time of log2(address bits) hash lookups. Thus only 5 hash lookups are needed for IPv4 and 7 for IPv6. We also introduce Mutating Binary Search and other optimizations that, for a typical IPv4 backbone router with over 33,000 entries, considerably reduce the average number of hashes to less than 2, of which one hash can be simplified to an indexed array access. We expect similar average case behavior for IPv6.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

CV95
 
CV96
 
D+97
Dan Decasper et el. Crossbow --- a toolkit for integrated services over cell switched IPv6. In Proceedt)tgs of the IEEEATM'97 workshop, Lisboa, Portugal, May 1997.
 
DH96
Steven Deering and Robert Hinden. Intemet protocol, version 6 (IPv6) specification (RFCi883). ftp:// ds.intemic.net/rfe/rfc1883.txt, 1996.
 
Dig95
Digital. GIGAswitch/FDDI networking switch, http:l/ www. networks.europe.digital.com/html/products_guide/ hp-swch3.html, 1995.
 
F+93
Vince Fuller et al. Classless Inter-Domain Routing (CIDR): an address assignment and aggregation strategy (RFC 1519). ftp://ds, intemic.net/rfe/ffcl 519.txt, 1993.
 
HD96
Robert Hinden and Steven Deering. IP version 6 addressing architecture (RFC1884). ftp:llds.intemic.netlrfe/ rfe 1884.txt, 1996.
 
Lab96
Craig Labovitz. Routing analysis, http'.//www, merit, edu/ ipma/analysis/routing.html, 1996.
 
Mer96
Merit Network, Inc. 12/19/96 routing table snapshot at Mac-East NAP. http://www, merit.edu/ipma/ routing_table/, January 1996.
 
MF93
A. McAuley and P. Francis. Fast routing table lookup using CAMs. In Proceedings oflNFOCOM, pages 1382- 1391, March-April 1993.
 
MTW95
Anthony J. McAuley, Paul F. Tsuehiya, and Daniel V, Wilson. Fast multilevel hierarchical routing table using content-addressable memory. U.S. Patent serial number 03'4 A-,444. Assignee Bell Communications research Inc Livingston NJ, January 1995.
 
NMH97
Peter Newman, Greg Minshall, and Larry Huston. IP Switching and gigabit touters. IEEE Communications Magazine, January 1997.
 
O’D97
Mike O'De!l. GSE- an alternate addressing architecture for IPv6. ftp://ds.intemic.net/intemet-drafts/draftietf. ipngwg-gseaddr-00.txt, 1997.
 
Par96
Craig Partridge. Locality and route caches. In NSF Workshop on internet Statistics Measurement and Analysis, San Diego, CA, USA, February 1996.
 
Per92
 
R+96
Yakov Rekhter et al. Tag switching architecture overview, ftp://ds.intemic.net/intemet-drafts/draft-rfcedinfo-rekhter-00.txt, 1996.
 
R+97
Yakov Rekhter et al. An IPv6 provider-based unicast address format (RFC2073). ftp://ds.intemic.net/ffc/ rfe2073.txt, 1997.
 
Rob97
Efica Roberts. IP on speed. Data Communications Magazine, pages 84--96, March 1997.
 
Skl93
Keith Sklower. A tree-based routing table for Berkeley Unix. Technical report, University of California, Berkeley, 1993.

CITED BY  85

Collaborative Colleagues:
Marcel Waldvogel: colleagues
George Varghese: colleagues
Jon Turner: colleagues
Bernhard Plattner: colleagues