Next generation routers

Proceedings of the IEEE

Volumn 90, Issue 9, 2002, Pages 1518-1558

  Chao, H Jonathan ^a,b  

^a IEEE   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Clos network switches; High performance routers; IP route lookup; Network processors; Packet arbitration; Packet classification; Packet scheduling; Packet switches

Indexed keywords

ALGORITHMS; BROADBAND NETWORKS; INTERFACES (COMPUTER); INTERNET; MODEMS; NETWORK PROTOCOLS; TELECOMMUNICATION TRAFFIC;

CLOS NETWORK SWITCHES; HIGH-PERFORMANCE ROUTERS; IP ROUTE LOOKUP; NETWORK PROCESSORS; PACKET ARBITRATION; PACKET CLASSIFICATION; PACKET SCHEDULING; PACKET SWITCHES;

ROUTERS;

EID: 0141524334     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2002.802001     Document Type: Article

References (86)

1. G. Vareille, F. Pitel, and J. F. Marcerou,"3-Tbit/s(300 × 11.6Gbit/s) transmission over 7380 km using C+L band with 25 GHz channel spacing and NRZ format," in Optical Fiber Communication Conf. Exhibit, 2001. PD22-1.
2. R. Ryf et al., "1296-port MEMS transparent optical crossconnect with 2.07 petabit/s switch capacity," in Optical Fiber Communication Conf. Exhibit, 2001, PD28-1.
3. Plugable Fiber Optic Link (12 × 2.5 Gbps) [Online]. Available: http://www.paracer.com
4. M21150 and M21 155 144 × 144 3.2 Gbps Crosspoint Switch [On-line]. Available: http://www.mindspeed.com
5. VC3003 140 7times; 140 Multi-Rate Crosspoint Switch With Clock, Data Recovery at Each Serial Input [Online]. Available: http://www.velio.com
6. C. Partridge et al., "A fifty gigabit per second IP router," IEEE/ACM Trans. Networking, vol. 6, pp. 237-248, June 1998.
7. VIT10: 10G Transponder and VSC8173/75: Physical Layer Multiplexer/Demultiplexer [Online]. Available: http://www.vitesse.com
8. CA16: 2.5 Gbit/s DWDM With 16-Channel 155 Mb/s Multiplexer and Demultiplexer and TB64: Uncoded 10 Gbit/s Transponder With 16-Channel 622 Mbit/s Multiplexor and Demultiplexer [Online]. Available: http://www.agere.com
9. M.-C. Chow, Understanding SONET/SDH: Standards and Applications. Holmdel, NJ: Andan Publisher, 1995.
10. S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," ACM/IEEE Trans. Networking, vol. 2, pp. 397-413, Aug. 1993.
11. V. Jacobson, "Quality of Service (QoS) Networking," Cisco System, June 1999.
12. A. Romanow and R. Oskouy, "A performance enhancement for packetized ABR and VBR+ data,", ATM Forum Contribution 94-0295, 1994.
13. G. Armitage and K. Adams, "Package reassembly during cell loss," IEEE/ACM Networking, vol. 7, pp. 26-34, Sept. 1993.
14. D. Stiliadis and A. Varma, "A general methodology for design efficient traffic scheduling and shaping algortihms," in IEEE INFOCOM, Apr. 1997, pp. 326-335.
15. J. C. R. Bennett and H. Zhang, "Hierarchical packet fair queuing algorithms," IEEE/ACM Trans. Networking, vol. 5, pp. 675-689, Oct. 1997.
16. H. J. Chao and X. Guo, Quality of Service Control in High-Speed Networks. New York: Wiley, 2001.
17. [Online]. Available: http://www.amcc.com
18. [Online]. Available: http://www.cognigine.com
19. [Online]. Available: http://www.conexant.com
20. [Online]. Available: http://www.ezchip.com
21. [Online]. Available: http://www.ibm.com
22. [Online]. Available: http://www.intel.com
23. [Online]. Available: http://www.internetmachines.com
24. [Online]. Available: http://www.lucent.com
25. [Online]. Available: http://www.motorola.com
26. [Online]. Available: http://www.solidum.com
27. [Online]. Available: http://www.vitesse.com
28. [Online]. Available: http://www.zettacom.com
29. T. Wolf, M. A. Franklyn, and E. Spitznagel, "Design tradeoffs for embedded network processors,", Washington Univ. Internal Rep., 2000.
30. J. Williams, "Architectures for network processing," IEEE VLSI Syst., pp. 61-64, 2001.
31. D. Husak. Network processors: A definition and comparison. Moro-torola. [Online]. Available: http://www.motorola.com
32. M. Janoska. (2000) Co-processors and the role of specialized hardware. Interop. [Online]. Available: http://www.csix.org/N+I%20pres/NP9%20MJanoska.PDF
33. The Network Processing Challenge (2001). [Online]. Available: http://www.solidum.com/resource_center/pdfs/93 004-PB-1.1.1- Network%20Processing%20Backgrounder.pdf
34. [Online]. Available: http://www.teja.com
35. P. Gupta, "Routing lookups and packet classifications: Theory and practice," in HOT INTERCONNECTS 8, Aug. 18, 2000.
36. D. Knuth, Fundamental Algorithms: Sorting and Searching. Reading, MA: Addison-Wesley, 1973, vol. 3.
37. V. Srinivasan and G. Varghese, "Faster IP lookups using controlled prefix expansion," in Proc. ACM SIGMATICS'98, June 1998, pp. 1-10.
38. S. Nilsson and G. Karlsson, "IP-Address lookup using LC-tries," IEEE J. Select. Areas Commun., vol. 17, p. 1083C92, June 1999.
39. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, "Small forwarding tables for fast routing lookups," in Proc. ACM SIGCOMM'97, Sept. 1997, pp. 3-14.
40. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable high-speed IP routing lookups," in Proc. ACM SIGCOMM'97, Sept. 1997, pp. 25-36.
41. B. Lampson, V. Srinivasan, and G. Varghese, "IP lookups using multiway and multicolumn search," Proc. IEEE INFOCOM'98, pp. 1248-1256, Apr. 1998.
42. J. Aoe, K. Morimoto, M. Shishibori, and K. Park, "A trie compaction algorithm for a large set of keys," IEEE Trans. Knowledge Data Eng., vol. 8, pp. 476-490, June 1996.
43. T. Kijkanjanarat and H. J. Chao, "Fast IP lookups using a two-trie data structure," Proc. IEEE GLOBECOM'99, pp. 1570-1575, Dec. 1999.
44. T. Kijkanjanarat, "Fast routing lookup and packet classification for next-generation routers," Ph.D. dissertation, Polytechnic Univ., Brooklyn, NY, 2002.
45. P. Gupta, S. Lin, and N. McKeown, "Routing lookups in hardware at memory access speeds," Proc. IEEEINFOCOM'98, pp. 1240-1247, Apr. 1998.
46. N. Huang, S. Zhao, J. Pan, and C. Su, "A fast IP routing lookup scheme for gigabit switching routers," Proc. IEEE INFOCOM'99, Mar. 1999.
47. D. Shah and P. Gupta, "Fast updating algorithms for TCAM's," IEEE Micro, vol. 21, pp. 36-47, Jan.-Feb 2001.
48. Ultra9M - Datasheet From SiberCore Technologies [Online]. Available: http://www.sibercore.com
49. LNI7040 - Datasheet From Lara Networks [Online]. Available: http://www.laranetworks.com
50. M. A. Ruiz-Sanchez, E. W. Biersack, and W. Dabbous, "Survey and taxonomy of IP address lookup algorithms," IEEE/ACM Trans. Networking, vol. 15, pp. 8-23, Man/Apr. 2001.
51. S. Lyer, R. R. Kompella, and A. Shelat, "ClassiPI: An architecture for fast and flexible packet classification," IEEE/ACM Trans. Networking, vol. 15, pp. 33-41, Mar./Apr. 2001.
52. P. Gupta and N. McKeown, "Algorithms for packet classification, " IEEE/ACM Trans. Nelworking, vol. 15, pp. 24-32, Mar/Apr. 2001.
53. V. Srinivasan, G. Varghese, S. Suri, and M. Waldvagel, "Fast and scalable layer four switchins," in Proc. ACM SIGCOMM'98, Aug. 1998, pp. 191-202.
54. P. Tsuchiya, "A search algorithm for table entries with non-contiguous wildcarding," Bellcore, internal document.
55. P. Gupta and N. McKeown, "Packet classification on multiple fields," in Proc. ACM SIGCOMM'99, Aug. 1999, pp. 147-160.
56. T. V. Lakshman and D. Stiliadis, "High-speed policy-based packet forwarding using efficient multi-dimensional range matching," in Proc. ACM SIGCOMM'98, Aug. 1998, pp. 203-214.
57. M. de Berg, M. van Kreveld, and M. Overmars, Computational Geometry: Algorithms and Applications, 2nd ed. Berlin, Germany: Springer-Verlag, 2000.
58. M. M. Buddhikot, S. Suri, and M. Waldvogel, "Space decomposition techniques for fast layer-4 switching," in Proc. Conf. Protocols for High Speed Neworks, Aug. 1999, pp. 25-41.
59. A. Feldmann and S. Muthukrishnan, "Tradeoffs for packet classification," Proc. IEEE INFOCOM'00, pp. 1193-1202, Mar. 2000.
60. P. Gupta and N. Mckeown, "Classification using hierarchical intelligent cuttings," in Proc. Hot Interconnects VII, Stanford, CA, Aug. 1999.
61. V. Srinivasan, S. Suri, and G. Varghese, "Packet classification using tuple space search," in Proc. ACM SIGCOMM'99, Aug. 1999, pp. 135-146.
62. H. J. Chao, "Saturn: A terabit packet switch using dual round-robin," IEEE Commun. Mag., vol. 38, pp. 78-84, Dec. 2000.
63. H. J. Chao, B.-S. Choe, J.-S. Park, and N. Uzun, "Design and implementation of abacus switch: A scalable multicast ATM switch," IEEE J. Select. Areas Commun., vol. 15, pp. 830-843, 1997.
64. N. McKeown, M. Izzard, A. Mekkittikul, W. Ellerisick, and M. Horowitz, "Tiny-tera: A packet switch core," IEEE Micro, pp. 26-33, Jan./Feb. 1997.
65. T. Chaney, J. A. Fingerhut, M. Hucke, and J. S. Turner, "Design of a gigabit ATM switch," Proc. IEEE INFOCOM'97, pp. 2-11, Apr. 1997.
66. H. J. Chao and B. S. Choe, "Design and analysis of a large-scale multicast output buffered ATM switch," IEEE/ACM Trans. Networking, vol. 3, pp. 112-138, Apr. 1995.
67. H. J. Chao, "A recursive modular terabit/sec ATM switch," IEEE J. Select. Areas Commun., vol. 9, pp. 1161-1172, Oct. 1991.
68. H. J. Chao, C. H. Lam, and E. Oki, Broadband Packet Switching Technologies: A Practical Guide to ATM Switches and IP Routers. New York: Wiley, 2001.
69. R. E. Tarjan, "Data structures and network algorithms," Soc. Ind. Appl. Math., Nov. 1983.
70. Y. Tamir and G. Frazier, "High performance multi-queue buffers for VLSI communication switches," in Proc. 15th Annu. Symp. Comput. Arch., June 1988, pp. 343-354.
71. J. E. Hopcroft and R. M. Karp, "An algorithm for maximum matching in bipartite graphs," Soc. Ind. Appl. Math. J. Computation, vol. 2, pp. 225-231, 1973.
72. N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, "Achieving 100% throughput in input-queued switches," IEEE Trans. Commum., vol. 47, 1260-1267, Aug. 1999.
73. N. McKeown, "Scheduling algorithm for input-queued cell switches," Ph.D. dissertation, University of California, Berkeley, 1995.
74. _, "The iSLIP scheduling algorithm for input-queued switches," IEEE/ACM Trans. Networking, vol. 7, pp. 188-200, Apr. 1999.
75. H. J. Chao and J.-S. Park, "Centralized contention resolution schemes for a large-capacity optical ATM switch," Proc. IEEE ATM Workshop'97, pp. 11-16, May 1998.
76. E. Oki, R. Rojas-Cessa, and H. J. Chao, "A pipeline-based approach for maximal-sized matching scheduling in input-buffered switches," IEEE Commun. Lett., vol. 5, pp. 263-265, June 2001.
77. Y. Li, S. Panwar, and H. J. Chao, "On the performance of a dual round-robin switch," in Proc. IEEE INFOCOM 2001, vol. 3, Apr. 2001, pp. 1688-1697.
78. _, "Performance analysis of an exhaustive service dual round-robin scheduling algorithm," in 2002 IEEE Workshop on High Performance Switching and Routing, May 2002.
79. H. Takagi, "Queueing analysis of polling models: An update," in Stochastic Analysis of Computer and Communication Systems. New York: Elsevier Science and B. V. North Holland, 1990, pp. 267-318.
80. F. M. Chiussi, J. G. Kneuer, and V. P. Kumar, "Low-cost scalable switching solutions for broadband networking: The ATLANTA architecture and chipset," IEEE Commun. Mag., pp. 44-53, Dec. 1997.
81. E. Oki, Z. Jing, R. Rojas-Cessa, and H. J. Chao, "Concurrent round-robin dispatching scheme for a clos-network switch," Proc. IEEE ICC 2001, pp. 107-111, June 2001.
82. [Online]. Available: http://www.cisco.com
83. [Online]. Available: http://www.pmc-sierra.com
84. [Online]. Available: http://www-3.ibm.com/chips/products/wired/products/ prsq64.html
85. T-Series routing platforms: System and packet forwarding architecture. Juniper Networks. [Online]. Available: http://www.juniper.net
86. Scalable Switching Fabrics for Internet Routers. Avici Systems. [Online]. Available: http://www.avici.com