Dynamic pipelining: Making IP-lookup truly scalable

Computer Communication Review

Volumn 35, Issue 4, 2005, Pages 205-216

  Hasan, Jahangir ^a   Vijaykumar, T N ^a  

^a Purdue University   (United States)

Author keywords

IP lookup; Longest prefix matching; Pipelined; Scalable; Tries

Indexed keywords

IP-LOOKUP; LONGEST PREFIX MATCHING; SCALABLE DYNAMIC PIPELINING (SDP); WORST CASE PREFIX DISTRIBUTIONS; IP LOOKUP; LONGEST-PREFIX MATCHING; PIPELINED; SCALABLE; TRIES;

CONFORMAL MAPPING; DATA STRUCTURES; INTERNET; ROUTERS; STORAGE ALLOCATION (COMPUTER); COMPUTER HARDWARE; MAPPING; MEMORY ARCHITECTURE; NETWORK ARCHITECTURE; PIPELINES; SCALABILITY;

NETWORK PROTOCOLS; INTERNET PROTOCOLS;

EID: 33847276266     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/1090191.1080116     Document Type: Conference Paper

References (19)

1. Anindya Basu and Girija Narlikar. Fast Incremental Updates for Pipelined Forwarding Engines. In Proceedings of INFOCOM '03, 2003.
2. CACTI. http://research.compaq.com/wrl/people/jouppi/CACTI.html
3. M. Degermark, A. Brodnik, S. Carlsson and S. Pink. Small Forwarding Tables for Fast Routing Lookups. In Procedings of SIGCOMM '97 1997.
4. W. Eatherton, Z. Dittia, G. Varghese. Tree Bitmap: Hardware/Software IP Lookups with Incremental Updates. ACM SIGCOMM Compter Communication Review, 34(2) 97-122, 2004.
5. Mathew Gray. Internet Growth Summary, http://www.rnit.edu/people/ mkgray/net/internet-growth-summary.html, 1996.
6. J. L. Hennessy and D. A. Patterson. Compter Architecture: a Quantitative Approach. Morgan Kaufman Publishers. 2002
7. V. Kumar, T. Lakshman and D. Stiliadis. Beyond Best Effort: Router Architectures for Differentiated Services of Tomorrow's Internet. IEEE Communications Magazine 36(5) 152-164, 1998
8. Integrated Device Technology, Inc. http://www.idt.com.
9. D. R. Morrison. PATRICIA - Practical Algorithm to Retrieve Information Coded in Alphanumeric. Journal of the ACM, 15(4)514-534, Oct. 1968.
10. NetLogic Microsystems, Inc. http://www.netlogicmicro.com.
11. S. Nilsson and G. Karlsson. Fast Address Look-up for Internet Routers. In Proceedings of The IEEE Conference on BroadBand Communications Technology. 1998.
12. Routing Information Service, http://www.ris.ripe.net.
13. D. Shah and P. Gupta. Fast Updating Algorithms for TCAMs. In Proceedings of IEEE MICRO, 21(1)36-47, Feb 2001.
14. Sandeep Sikka and George Varghese. Memory-Efficient State Look-ups with Fast Updates. In Proceedings of SIGCOMM '00, 2000
15. Timothy Sherwood, George Varghese and Brad Calder. A Pipelined Memory Architecture for High Throughput Network Processors. In Proceedings of the 30th Annual ISCA, pages 288-299, 2003.
16. K. Sklower. A Tree-Based Routing Table for Berkeley Unix. In Proceedings of the 1991 Winter Usenix Conference. 1991.
17. V. Srinivasan and George Varghese. Fast Address Lookups Using Controlled Prefix Expansion. ACM Transactions on Computer Systems, 17(1):1-40, February 1999.
18. Alan Tammel. How to Survive as an ISP. In Proceedings of Networld Interop 97, 1997.
19. F. Zane, G. Narlikar and A. Basu. CoolCAMs: Power-Efficient TCAMs for Forwarding Engines. In Proceedings of INFOCOM '03, 2003.