TY - JOUR
T1 - Next generation routers
AU - Chao, H. Jonathan
N1 - Funding Information:
Manuscript received February 28, 2002; revised May 15, 2002. This work was supported in part by the National Science Foundation under Grant 9814856 and Grant 9906673 and in part by the New York State Center for Advanced Technology in Telecommunications.
PY - 2002
Y1 - 2002
N2 - 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.
AB - 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.
KW - Clos network switches
KW - High-performance routers
KW - IP route lookup
KW - Network processors
KW - Packet arbitration
KW - Packet classification
KW - Packet scheduling
KW - Packet switches
UR - http://www.scopus.com/inward/record.url?scp=0141524334&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0141524334&partnerID=8YFLogxK
U2 - 10.1109/JPROC.2002.802001
DO - 10.1109/JPROC.2002.802001
M3 - Article
AN - SCOPUS:0141524334
SN - 0018-9219
VL - 90
SP - 1518
EP - 1558
JO - Proceedings of the IEEE
JF - Proceedings of the IEEE
IS - 9
ER -