Publikationstyp: | Beitrag zu einer Konferenz |
URI (zitierfähiger Link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-24730 |
Autor/innen: | Waldvogel, Marcel; Varghese, George; Turner, Jonathan; Plattner, Bernhard |
Erscheinungsjahr: | 1998 |
Konferenz: | the seventeenth annual ACM symposium, 28. Jun 1998 - 2. Jul 1998, Puerto Vallarta, Mexico |
Erschienen in: | Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98. - New York, New York, USA : ACM Press, 1998. - S. 312. - ISBN 0-89791-977-7 |
DOI (zitierfähiger Link): | https://dx.doi.org/10.1145/277697.277765 |
Zusammenfassung: |
All global routing protocols use hierarchies to allow scaling to a world wide community while keeping the routing database size manageable. Databases of variable length prefixes are a powerful tool for providing this in a flexible manner, but require a Longest Prefix Matching algorithm. In this paper, we report a fundamentally new solution that is both algorithmically interesting and practical.
Our scheme is based on doing binary search on hash tables organized by prefix lengths, and 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. With the current Internet Protocol, which uses 32 bit addresses, at most 5 hash lookups are needed; for the upcoming 128 bit addresses of the next generation Internet Protocol (IPv6), 7 lookups suffice. Several refinements, including specializing the Binary Search with every match, considerably reduce the average number of hash search steps to less than 2. |
Fachgebiet (DDC): | 004 Informatik |
Link zur Lizenz: | Nutzungsbedingungen |
WALDVOGEL, Marcel, George VARGHESE, Jonathan TURNER, Bernhard PLATTNER, 1998. Scalable Best Matching Prefix Lookups. the seventeenth annual ACM symposium. Puerto Vallarta, Mexico, 28. Jun 1998 - 2. Jul 1998. In: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98. the seventeenth annual ACM symposium. Puerto Vallarta, Mexico, 28. Jun 1998 - 2. Jul 1998. New York, New York, USA:ACM Press, pp. 312. ISBN 0-89791-977-7. Available under: doi: 10.1145/277697.277765
@inproceedings{Waldvogel1998Scala-6211, title={Scalable Best Matching Prefix Lookups}, year={1998}, doi={10.1145/277697.277765}, isbn={0-89791-977-7}, address={New York, New York, USA}, publisher={ACM Press}, booktitle={Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98}, author={Waldvogel, Marcel and Varghese, George and Turner, Jonathan and Plattner, Bernhard} }
scalable_best_matching_prefix_lookups.pdf | 87 |