Next generation routers

As the broadband access technologies, such as DSL, cable modem, and gigabit Ethernet, are providing affordable broadband solutions to the Internet from home and the enterprise, it is required to build next generation routers with high-speed interfaces (e.g., 10 or 40 Gb/s) and large switching capacity (e.g., multipetabit). This paper first points out the issues of building such routers, such as memory speed constraint, packet arbitration bottleneck, and interconnection complexity. It then presents several algorithms/architectures to implement IP route lookup, packet classification, and switch fabrics. Some of the functions, such as packet classification, route lookup, and traffic management, can be implemented with emerging network processors that have the advantages of providing flexibility to new applications and protocols, shortening the design cycle and time-to-market, and reducing the implementation cost by avoiding the ASIC approach. Several proposed algorithms for IP route lookup and packet classification are compared in respect to their search/update speeds and storage requirements. Different efficient arbitration schemes for output port contention resolution are presented and analyzed. The paper also surveys various switch architectures of commercial routers and switch chip sets. At the end, it outlines several challenging issues that remain to be researched for next generation routers.

[1]  Nick McKeown,et al.  Algorithms for packet classification , 2001, IEEE Netw..

[2]  Butler W. Lampson,et al.  IP lookups using multiway and multicolumn search , 1999, TNET.

[3]  H. Jonathan Chao,et al.  Design and Implementation of Abacus Switch: A Scalable Multicast ATM Switch , 1997, IEEE J. Sel. Areas Commun..

[4]  Nick McKeown,et al.  The Tiny Tera: A Packet Switch Core , 1998, IEEE Micro.

[5]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM '96.

[6]  Bernhard Plattner,et al.  Scalable high speed IP routing lookups , 1997, SIGCOMM '97.

[7]  Nick McKeown,et al.  Classifying Packets with Hierarchical Intelligent Cuttings , 2000, IEEE Micro.

[8]  Hung-Hsiang Jonathan Chao,et al.  Fast IP lookups using a two-trie data structure , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[9]  Ming-Chwan Chow.  Understanding SONET/SDH: Standards and Applications , 1995 .

[10]  Eiji Oki,et al.  Broadband Packet Switching Technologies: A Practical Guide to ATM Switches and IP Routers , 2001 .

[11]  Craig Partridge,et al.  A Fifty Gigabit Per Second IP Router , 2001 .

[12]  Anujan Varma,et al.  A general methodology for designing efficient traffic scheduling and shaping algorithms , 1997, Proceedings of INFOCOM '97.

[13]  H. Jonathan Chao,et al.  On the performance of a dual round-robin switch , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Walid Dabbous,et al.  Survey and taxonomy of IP address lookup algorithms , 2001, IEEE Netw..

[15]  Tilman Wolf,et al.  Design Tradeoffs for Embedded Network Processors , 2002, ARCS.

[16]  F. M. Chiussi,et al.  Low-cost scalable switching solutions for broadband networking: the ATLANTA architecture and chipset , 1997 .

[17]  Venkatachary Srinivasan,et al.  Packet classification using tuple space search , 1999, SIGCOMM '99.

[18]  Nick McKeown,et al.  Scheduling algorithms for input-queued cell switches , 1996 .

[19]  H. Jonathan Chao,et al.  Saturn: a terabit packet switch using dual round-robin , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[20]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[21]  Gunnar Karlsson,et al.  IP-address lookup using LC-tries , 1999, IEEE J. Sel. Areas Commun..

[22]  Nen-Fu Huang,et al.  A fast IP routing lookup scheme for gigabit switching routers , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[23]  Paul F. Tsuchiya,et al.  A search algorithm for table entries with non-contiguous wildcarding , 1991 .

[24]  P. Giblin.  Computational geometry: algorithms and applications (2nd edn.), by M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf. Pp. 367. £20.50. 2000. ISBN 3 540 65620 0 (Springer-Verlag). , 2001, The Mathematical Gazette.

[25]  Yuval Tamir,et al.  High-performance multiqueue buffers for VLSI communication switches , 1988, [1988] The 15th Annual International Symposium on Computer Architecture. Conference Proceedings.

[26]  Masami Shishibori,et al.  A Trie Compaction Algorithm for a Large Set of Keys , 1996, IEEE Trans. Knowl. Data Eng..

[27]  George Varghese,et al.  Faster IP lookups using controlled prefix expansion , 1998, SIGMETRICS '98/PERFORMANCE '98.

[28]  H. Jonathan Chao.  A Recursive Modular Terabit/Second ATM Switch , 1991, IEEE J. Sel. Areas Commun..

[29]  David Husak.  Network Processors : A Definition and Comparison , 2000 .

[30]  Svante Carlsson,et al.  Small forwarding tables for fast routing lookups , 1997, SIGCOMM '97.

[31]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[32]  Nick McKeown,et al.  Routing lookups in hardware at memory access speeds , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[33]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[34]  Subhash Suri,et al.  Space Decomposition Techniques for Fast Layer-4 Switching , 1999, Protocols for High-Speed Networks.

[35]  H. Jonathan Chao,et al.  Design and analysis of a large-scale multicast output buffered ATM switch , 1995, TNET.

[36]  H. Jonathan Chao,et al.  Quality of Service Control in High-Speed Networks , 2001 .

[37]  Devavrat Shah,et al.  Fast Updating Algorithms for TCAMs , 2001, IEEE Micro.

[38]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[39]  Eiji Oki,et al.  A pipeline-based approach for maximal-sized matching scheduling in input-buffered switches , 2001, IEEE Communications Letters.

[40]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1996 .

[41]  Anja Feldmann,et al.  Tradeoffs for packet classification , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[42]  T. V. Lakshman,et al.  High-speed policy-based packet forwarding using efficient multi-dimensional range matching , 1998, SIGCOMM '98.

[43]  Eiji Oki,et al.  Broadband Packet Switching Technologies , 2001 .

[44]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[45]  J. Williams.  Architectures for network processing , 2001, 2001 International Symposium on VLSI Technology, Systems, and Applications. Proceedings of Technical Papers (Cat. No.01TH8517).

[46]  Lemin Li,et al.  A high-speed and scalable switching fabrics for Internet routers , 2002, IEEE 2002 International Conference on Communications, Circuits and Systems and West Sino Expositions.

[47]  Y. Tamir,et al.  High-performance multi-queue buffers for VLSI communications switches , 1988, ISCA '88.

[48]  Eiji Oki,et al.  Concurrent round-robin dispatching scheme in a clos-network switch , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[49]  David Waitzman,et al.  A 50-Gb/s IP router , 1998, TNET.

[50]  Hung-Hsiang Jonathan Chao,et al.  Centralized contention resolution schemes for a large-capacity optical ATM switch , 1998, 1998 IEEE ATM Workshop Proceedings. 'Meeting the Challenges of Deploying the Global Broadband Network Infrastructure' (Cat. No.98EX164).

[51]  Sundar Iyer,et al.  ClassiPl: an architecture for fast and flexible packet classification , 2001, IEEE Netw..

[52]  Pankaj Gupta,et al.  Packet Classification using Hierarchical Intelligent Cuttings , 1999 .

[53]  K.M. Adams,et al.  Packet reassembly during cell loss , 1993, IEEE Network.

[54]  Jonathan S. Turner,et al.  Design of a gigabit ATM switch , 1997, Proceedings of INFOCOM '97.

[55]  G. Vareille,et al.  3 Tbit/s (300/spl times/11.6Gbit/s) transmission over 7380 km using C+L band with 25GHz channel spacing and NRZ format , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).

[56]  Nick McKeown,et al.  Packet classification on multiple fields , 1999, SIGCOMM '99.

[57]  George Varghese,et al.  Fast and scalable layer four switching , 1998, SIGCOMM '98.

[58]  C. R. Giles,et al.  1296-port MEMS transparent optical crossconnect with 2.07 petabit/s switch capacity , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).