Next generation Tbit/sec routers and switches: traffic modeling, scheduling algorithms, and simulations

Authors:
D. Sadot;Y. Nachmani;A. Bar-Noy;S. Kutten
Affiliations:
Electrical and Computer Engineering Department, Ben Gurion University, Beer Sheva, Israel;Electrical and Computer Engineering Department, Ben Gurion University, Beer Sheva, Israel;Department of Electrical Engineering-Systems, Tel Aviv University, Tel Aviv, Israel;Faculty of Industrial Engineering, Technion, Haifa, Israel
Venue:
Journal of High Speed Networks
Year:
2002

Citing 8
Cited 0

Data networks

Data networks
Improving the performance of input-queued ATM packet switches

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1)
An introduction to broadband networks: LANs, MANs, ATM, B-ISDN, and optical networks for integrated multimedia telecommunications

An introduction to broadband networks: LANs, MANs, ATM, B-ISDN, and optical networks for integrated multimedia telecommunications
Two-dimensional round-robin schedulers for packet switches with multiple input queues

IEEE/ACM Transactions on Networking (TON)
Analysis of nonblocking ATM switches with multiple input queues

IEEE/ACM Transactions on Networking (TON)
Tiny Tera: A Packet Switch Core

IEEE Micro
Achieving 100% throughput in an input-queued switch

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Low-cost scalable switching solutions for broadband networking: the ATLANTA architecture and chipset

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling algorithms for next generation multi Tbit/sec routers and switches are evaluated. Concurrently, available packet interconnections do not exceed a few hundreds Gbit/sec of aggregate throughput, making traffic modeling and computer simulations an extremely important tool. Here, traffic modeling is investigated in terms of arrival process and destination distribution. 'Real world' traffic models are proposed, and extensive simulations are carried out and compared to theoretical predictions. It is shown that conventional scheduling algorithms, such as round robin, perform very well under 'convenient' simulation assumptions, e.g., heavy load and uniform distribution assumptions. However, when traffic modeling is oriented towards modern applications such as bursty arrival process as in compressed video, or non-uniform destination distribution as in Internet sites popularity, detailed and quantitative simulation results prove that algorithm performances are significantly degraded from over 95% to less than 60% of maximum throughput. A modified 'adaptive' round robin algorithm is proposed, yielding significant improvement of 20% in the router's maximum throughput.