Fast and scalable schemes for the ip address lookup problem

IEEE International Conference on High Performance Switching and Routing, HPSR

Volumn , Issue , 2000, Pages 83-92

  Yazdani, Nasser ^a   Min, Paul S ^a,b  

^a WASHINGTON UNIVERSITY   (United States)

^b Erlang Technology Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMMUNICATION SYSTEMS; INTERNET PROTOCOLS; TABLE LOOKUP; TREES (MATHEMATICS);

BINARY PREFIX TREE; BINARY SEARCH TREES; COMMUNICATION LINES; IP ADDRESS LOOKUP; LONGEST MATCHING PREFIXES; LONGEST-PREFIX MATCHING; SEARCH PERFORMANCE; SYSTEMATIC METHOD;

BINARY TREES;

EID: 84905385128     PISSN: 23255595     EISSN: 23255609     Source Type: Journal    
DOI: 10.1109/HPSR.2000.856650     Document Type: Article

References (16)

1. Tzi-cker Chiueh, Prashant Pradhan, "High Performance IP Routing Table Lookup Using CPU Caching", submitted to IEEE Infocomm 1999.
2. [CoLR90] Thomas H. Cormen, Charles E. Leiserson and Ronald L. Riverst, "Introduction to Algorithms", The MIT press, 1990.
3. [DeBC97] Mikael Degermark, Andrej Brondnik, Svante Carlsson and Stephen Pink, "Small Forwarding Tables for Fast Routing Lookups", Proceeding of SIGCOMM 1997.
4. [DoKN96] W.Doeringer, G. Karjoth and M. Nassehi, "Routing on Longest-Matching Prefixes.", IEEE/ACM Trans. Networking, vol. 4, no.l, pp. 6-97, Feb. 1996.
5. [Eath99] William Eatherton, " Internet Protocol Prefix Lookups ", A Master Thesis, Washington Univ., St. Louis, May 1999.
6. [GoBa91] G. H. Gonnet and R. A. Baeza-Yates, "Handbook of Algorithms and Data Structures.", Addison Wesley, 2th Edition, 1991.
7. [LaSv98] B. Lampson, V. Srinivasan, G. Varhese. IP Lookups Using Multiway and Multicolumn Search." 1998.
8. [NeMH97] P. Newman, G. Minshall and L. Huston, "IP Switching and Gigabit Routers.", IEEE Communications Magazine, Jan. 1997.
9. [NiKa98] S. Nilsson and G. Karlsson, "Fast Address Lookup for Internet Routers.", Proceedings of IEEE Broadband Communication 98, Apr. 1998.
10. [NiKa98b] S. Nilsson and G. Karlsson, "Implementing a Dynamic Compressed Trie.", Proceedings of WAE98, Sarbrucken, Germany, Aug. 1998.
11. [SKL091] Sklower, K., "A Tree-Based Routing Table for Berkeley Unix", Proceeding of the Winter Usenix Conference, 1991.
12. [SrVa98] V. Srinivasan and George Varghese, "Fast Address Lookups using Controlled Prefix", Proceedings of ACM Sigmetrics, Sep. 1998.
13. [Torr98] Torrent Networking Technologies Corporation, "High-Speed Routing Table Search Algorithms", A technical paper, http://www.torrentnet. com.
14. [Turn99] Johanaton Turner "Design and Analysis of Switching systems", Washington University, St. Louis, Missouri, Jan. 1999.
15. [VFWC98] A. Viswanathan, N. Feldman, Z. Wang and R. Callon, "Evolution of Multiprotocol Label Switching", IEEE Communications Magazine, May 1998.
16. [WaVT97] Marcel Waldvogel, George Varghese, Jon Turner, Bernhard Plattner, "Scalable High Speed IP Routing Lookups", Proceedings of ACM Sigcomm, Sep. 1997.