Scalable High Speed IP Routing Table Lookups

Cite This

Files in this item

Checksum: MD5:b6117377f62bfae098b8d487ca180a55

WALDVOGEL, Marcel, George VARGHESE, Jon TURNER, Bernhard PLATTNER, 1997. Scalable High Speed IP Routing Table Lookups. the ACM SIGCOMM '97 conference. Cannes, France, Sep 14, 1997 - Sep 18, 1997. In: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication - SIGCOMM '97. New York, New York, USA:ACM Press, pp. 25-36. ISBN 0-89791-905-X. Available under: doi: 10.1145/263105.263136

@inproceedings{Waldvogel1997Scala-6014, title={Scalable High Speed IP Routing Table Lookups}, year={1997}, doi={10.1145/263105.263136}, isbn={0-89791-905-X}, address={New York, New York, USA}, publisher={ACM Press}, booktitle={Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication - SIGCOMM '97}, pages={25--36}, author={Waldvogel, Marcel and Varghese, George and Turner, Jon and Plattner, Bernhard} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dspace:hasBitstream rdf:resource=""/> <bibo:uri rdf:resource=""/> <dc:language>eng</dc:language> <dc:contributor>Waldvogel, Marcel</dc:contributor> <dc:date rdf:datatype="">2011-03-24T16:08:45Z</dc:date> <dc:format>application/pdf</dc:format> <dc:contributor>Turner, Jon</dc:contributor> <dc:creator>Waldvogel, Marcel</dc:creator> <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Varghese, George</dc:creator> <dc:creator>Turner, Jon</dc:creator> <dcterms:hasPart rdf:resource=""/> <dcterms:issued>1997</dcterms:issued> <dcterms:available rdf:datatype="">2011-03-24T16:08:45Z</dcterms:available> <dcterms:abstract xml:lang="eng">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.</dcterms:abstract> <dcterms:title>Scalable High Speed IP Routing Table Lookups</dcterms:title> <dcterms:isPartOf rdf:resource=""/> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:bibliographicCitation>First publ. in: Proceedings of ACM SIGCOMM '97 Conference on Applications, Technologies, Architecture and Protocols for Computer Communication, Cannes, France, 1997, pp. 25-36</dcterms:bibliographicCitation> <dc:contributor>Plattner, Bernhard</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Plattner, Bernhard</dc:creator> <dcterms:rights rdf:resource=""/> <dc:contributor>Varghese, George</dc:contributor> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

scalable_high_speed_IP_Routing_table_lookups.pdf 946

This item appears in the following Collection(s)

Attribution-NonCommercial-NoDerivs 2.0 Generic Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 2.0 Generic

Search KOPS


My Account