Shape shifting tries for faster IP route lookup

Proceedings - International Conference on Network Protocols, ICNP

Volumn 2005, Issue , 2005, Pages 358-367

  Song, Haoyu ^a   Turner, Jonathan ^a   Lockwood, John ^a  

^a WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IP ROUTE; SHAPE SHIFTING; WIRE SPEED PROCESSING;

ALGORITHMS; INTERNET; NETWORK PROTOCOLS; ROUTERS; SIGNAL ENCODING;

DATA STRUCTURES;

EID: 33750935479     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2005.36     Document Type: Conference Paper

References (20)

1. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, "Small Forwarding Tables for Fast Routing Lookups," in Proceedings of ACM SIGCOMM, 1997.
2. W. Eatherton, "Fast IP Lookup Using Tree Bitmap," Washington University Master Thesis, 1999.
3. V. Srinivasan and G. Varghese, "Fast Address Lookups using Controlled Prefix Expansion," ACM Transaction on Computer Systems, vol. 17, Feb. 1999.
4. B. Lampson, V. Srinivasan, and G. Varghese, "IP Lookups Using Multiway and Multicolumn Search," IEEE/ACM Transactions on Networking, vol. 7, June 1999.
5. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable High Speed IP Routing Lookups," in Proceedings of SIGCOMM, 1997.
6. F. Baboescu and G. Varghese, "Scalable Packet Classification," in ACM Sigcomm, San Diego, CA, Aug. 2001.
7. J. Lunteren and T. Engbersen, "Fast and Scalable Packet Classification," IEEE Journal on Selected Areas in Communications, vol. 21, May 2003.
8. D. Taylor and J. Turner, "Scalable Packet Classification Using Distributed Crossproducting of Field Labels," in Proceedings of IEEE Infocom, July 2005.
9. G. Jacobson, "Succinct Static Data Structure," Carnegie Mellon University Ph.D Thesis, 1988.
10. D. Taylor, J. Lockwood, T. Sproull, J. Turner, and D. Parlour, "Scalable IP Lookup for Programmable Routers," in Proceedings of IEEE Infocom, June 2002.
11. "BGP Reports," in http://bgp.potaroo.net/.
12. "IPv6 Address Allocation and Assignment Policy (APNIC)," in http://www.apnic.net/docs/policy/ipv6-address-policy.html.
13. M. Wang, S. Deering, T. Hain, and L. Dunn, "Non-Random Generator for IPv6 Tables," in 12th Annual IEEE Symposium on High Performance Interconnects, Stanford University, CA, Aug. 2004.
14. H. Liu, "Routing Table Compaction in Ternary CAM," IEEE Micro, vol. 22, Jan. 2002.
15. K. Sklower, "A Tree-based Routing Table for Berkeley Unix," in Winter Usenix Conference, Dallas, TX, 1991.
16. S. Sahni and K. S. Kim, "Efficient Construction of Multibit Tries for IP Lookup," IEEE/ACM Transactions on Networking, vol. 11, Aug. 2003.
17. H. H.-Y. Tzeng, "Longest Prefix Search Using Compressed Trees," in Proceedings of IEEE Global Communication Conference, July 1998.
18. M. Desai, R. Gupta, A. Karandikar, K. Saxena, and V. Samant, "Reconfigurable Finite-State Machine Based IP Lookup Engine for High-Speed Router," IEEE Journal on Selected Areas in Communications, vol. 21, May 2003.
19. R. J. Francis, J. Rose, and K. Chung, "Chortle: A Technology Mapping Program for Lookup Table-based Field Programmable Gate Arrays," in 27th Annual ACM/IEEE Conference on Design Automation, 1991.
20. J. Cong and Y. Ding, "FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimaization in Lookup-Table Based FPGA Designs," in Proceedings of the IEEE International Conference on Computer-Aided Design, Nov. 1992.