Fast incremental updates for pipelined forwarding engines

IEEE/ACM Transactions on Networking

Volumn 13, Issue 3, 2005, Pages 690-703

  Basu, Anindya ^a   Narlikar, Girija ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Core routers; Packet forwarding; Pipelined IP lookup; Route updates

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; DATA STRUCTURES; INTERNET; OPTIMIZATION; PACKET NETWORKS; PIPELINE PROCESSING SYSTEMS; SEARCH ENGINES; TABLE LOOKUP;

CORE ROUTERS; PACKET FORWARDING; PIPELINED IP LOOKUP; ROUTE UPDATES;

ROUTERS;

EID: 23344449322     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.850216     Document Type: Article

References (25)

1. D. A. Patterson and J. L. Hennessy, Computer Organization and Design: The Hardware/Software Interface, 2nd ed. San Francisco, CA: Morgan Kaufmann, 1997.
2. P. Gupta, S. Lin, and N. McKeown, "Routing lookups in hardware at memory access speeds," in Proc. IEEE INFOCOM, San Francisco, CA, Apr. 1998, pp. 1240-1247.
3. S. Sikka and G. Varghese, "Memory-efficient state lookups with fast updates," in Proc. ACM SIGCOMM, Stockholm, Sweden, Aug. 2000, pp. 335-347.
4. V. Srinivasan and G. Varghese, "Fast address lookups using controlled prefix expansion," ACM Trans. Comput. Syst., vol. 17, no. 1, pp. 1-40, Feb. 1999.
5. G. Cheung and S. McCanne, "Optimal routing table design of IP address lookups under memory constraints," in Proc. IEEE INFOCOM, New York, Mar. 1999, pp. 1437-1444.
6. P. Crescenzi, L. Dardini, and R. Grossi, IP Address Lookup Made Fast and Simple, 1999, vol. 1643, Lecture Notes in Computer Science, pp. 65-76.
7. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, "Small forwarding tables for fast routing lookups," in Proc. ACM SIGCOMM, Cannes, France, Sep. 1997, pp. 3-14.
8. R. P. Draves, C. King, S. Venkatachary, and B. N. Zill, "Constructing optimal IP routing tables," in Proc. IEEE INFOCOM, New York, Mar. 1999, pp. 88-97.
9. B. Lampson, V. Srinivasan, and G. Varghese, "IP lookups using multiway and multicolumn search," in Proc. IEEE INFOCOM, San Francisco, CA, Apr. 1998, pp. 1248-1256.
10. D. R. Morrison, "PATRICIA - Practical algorithm to retrieve information coded in alphanumeric," J. ACM, vol. 15, no. 4, pp. 514-534, Oct. 1968.
11. S. Nilsson and G. Karlsson, "IP-address lookup using LC-tries," IEEE J. Select. Areas Commun., vol. 17, no. 6, pp. 1083-1092, Jun. 1999.
12. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable hversus IP routing lookups," in Proc. ACM SIGCOMM, Cannes, France, Sep. 1997, pp. 25-38.
13. C. Systems, "The Evolution of High-End Router Architectures," White Paper, 2001.
14. C. Semeria, "Implementing a Flexible Hardware-Based Router for the New IP Infrastructure Juniper Networks," White Paper, 2001.
15. G. Huston, "Analyzing the Internet's BGP routing table," Internet Protocol J., vol. 4, 2001.
16. C. Labovitz, A. Ahuja, and F. Jahanian, "Experimental study of Internet stability and wide-area backbone failures," in Proc. 29th Annu. Int. Symp. Fault-Tolerant Computing, Madison, WI, Jun. 1999.
17. C. Labovitz, G. R. Malan, and F. Jahanian, "Origins of Internet routing instability," in Proc. IEEE INFOCOM, New York, Mar. 1999, pp. 218-226.
18. P. Gupta, B. Prabhakar, and S. Boyd, "Near-optimal routing lookups with bounded worst case performance," in Proc. IEEE INFOCOM, Tel Aviv, Israel, Mar. 2000, pp. 1184-1192.
19. L. L. Larmore and T. M. Przytycka, "A fast algorithm for optimum height-limited alphabetic binary trees," SIAM J. Comput., vol. 23, no. 6, pp. 1283-1312, Dec. 1994.
20. K. Sklower, "A tree-based packet routing table for Berkeley UNIX," in Proc. Winter 1991 USENIX Conf., Berkeley, CA, Jan. 1991, pp. 93-104.
21. G. Narlikar and F. Zane, "Performance modeling for fast IP lookups," in Proc. ACM SIGMETRICS, Cambridge, MA, Jun. 2001.
22. IDT [Online]. Available: http://www.idt.com
23. Netlogic Microsystems [Online]. Available: http://www.netlogicmicro.com
24. H. Liu, "Routing table compaction in ternary CAM," IEEE Micro, vol. 22, no. 1, pp. 58-54, Jan.-Feb. 2002.
25. D. Shah and P. Gupta, "Fast updating algorithms for TCAMs," IEEE Micro, vol. 21, no. 1, pp. 36-47, Jan.-Feb. 2001.