Fast incremental updates for pipelined forwarding engines

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2003, Pages 64-74

  Basu, Anindya ^a   Narlikar, Girija ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPLICATION SPECIFIC INTEGRATED CIRCUITS; ASSOCIATIVE STORAGE; COMPUTER ARCHITECTURE; DATA STRUCTURES; NETWORK PROTOCOLS; OPTIMIZATION; PACKET NETWORKS; PIPELINE PROCESSING SYSTEMS; SEARCH ENGINES; TABLE LOOKUP; ROUTERS;

INTERNET PROTOCOLS (IP);

ROUTERS; COMPUTER ARCHITECTURE;

ASIC ARCHITECTURE; INCREMENTAL UPDATES; IP ROUTERS; MEMORY UTILIZATION; MULTIPLE PIPELINES; PIPELINED FORWARDING ENGINES; ROUTE UPDATES; ROUTING TABLE;

EID: 0042475248     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. G. Cheung and S. McCanne. Optimal Routing Table Design of IP Address Lookups Under Memory Constraints. In Proceedings of Infocom '99, pages 1437-1444, New York, NY, March 1999.
2. Cisco Systems. The Evolution of High-end Router Architectures. White paper, 2001.
3. P. Crescenzi, L. Dardini, and R. Grossi. IP Address Lookup Made Fast and Simple. Lecture Notes in Computer Science, 1643:65-76, 1999.
4. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink. Small Forwarding Tables for Fast Routing Lookups. In Proceedings of SIGCOMM '97, pages 3-14, Cannes, France, September 1997.
5. R. P. Draves, C. King, S. Venkatachary, and B. N. Zill. Constructing Optimal IP Routing Tables. In Proceedings of Infocom '99, New York, NY, March 1999.
6. P. Gupta, S. Lin, and N. McKeown. Routing Lookups in Hardware at Memory Access Speeds. In Proceedings of Infocom '98, pages 1240- 1247, San Francisco, CA, April 1998.
7. P. Gupta, B. Prabhakar, and S. Boyd. Near-Optimal Routing Lookups with Bounded Worst Case Performance. In Proceedings of Infocom '00, pages 1184-1192, Tel Aviv, Israel, March 2000.
8. G. Huston. Analyzing the Internet's BGP Routing Table. The Internet Protocol Journal, 4, 2001.
9. IDT. http://www.idt.com.
10. C. Labovitz, A. Ahuja, and F. Jahanian. Experimental Study of Internet Stability and Wide-Area Backbone Failures. In Proceedings of the Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing, Madison, WI, June 1999.
11. C. Labovitz, G. R. Malan, and F. Jahanian. Origins of Internet Routing Instability. In Proceedings of Infocom '99, New York, NY, March 1999.
12. B. Lampson, V. Srinivasan, and G. Varghese. IP Lookups Using Multiway and Multicolumn Search. In Proceedings of Infocom '98, pages 1248- 1256, San Francisco, CA, April 1998.
13. L. L. Larmore and T. M. Przytycka. A Fast Algorithm for Optimum Height-Limited Alphabetic Binary Trees. SIAM Journal on Computing, 23(6):1283-1312, December 1994.
14. H. Liu. Routing Table Compaction in Ternary CAM. IEEE Micro, 22(1):58-64, January-February 2002.
15. D. R. Morrison. PATRICIA - Practical Algorithm to Retrieve Information Coded in Alphanumeric. Journal of the ACM, 15(4):514-534, October 1968.
16. G. Narlikar and F. Zane. Performance Modeling for Fast IP Lookups. In Proceedings of ACM SIGMETRICS '01, Cambridge, MA, June 2001.
17. Netlogic microsystems, http : //www.netlogicmicro.com.
18. S. Nilsson and G. Karlsson. Fast Address Look-Up for Internet Routers. IEEE Journal on Selected Areas in Communications, pages 1083-1092, June 1999.
19. D. A. Patterson and J. L. Hennessy. Computer Organization and Design: The Hardware/Software Interface. Morgan Kaufmann, San Francisco, CA, 2nd edition, 1997.
20. C. Semeria. Implementing a Flexible Hardware-based Router for the New IP Infrastructure. White paper, Juniper Networks, September 2001.
21. D. Shah and P. Gupta. Fast Updating Algorithms for TCAMs. IEEE Micro, 21(1):36-47, January-February 2001.
22. S. Sikka and G. Varghese. Memory-Efficient State Lookups with Fast Updates. In Proceedings of SIGCOMM '00, pages 335-347, Stockholm, Sweden, August 2000.
23. K. Sklower. A Tree-Based Packet Routing Table for Berkeley UNIX. In Proceedings of the Winter 1991 USENIX Conference, pages 93-104, Berkeley, CA, January 1991.
24. V. Srinivasan and G. Varghese. Fast Address Lookups Using Controlled Prefix Expansion. ACM Transactions on Computer Systems, 17(1):1-40, February 1999.
25. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner. Scalable High Speed IP Routing Lookups. In Proceedings of SIGCOMM '97, pages 25- 38, Cannes, France, September 1997.