Abstract
A packet-aware non-interleaving scheduling algorithm that has multiple classes according to the packet lengths is proposed, and the latencies and buffer requirement are investigated in comparison with other algorithms. The non-interleaving scheduling algorithm eliminates the complexity of packet reassembly at the output queue. The simulated results show that the packet-aware non-interleaving scheduling inherently improves the latency of the long packets, while the proposed multi-class scheduling complementarily improves the latency of the short packets. The results show that the non-interleaving algorithm is not only feasible for the practical implementation but may have better performance in the latency, output buffer requirement, and implementation complexity viewpoints, if appropriate scheduling algorithm is used. The simulated results are obtained using self-similar traffic generated based on the measured Internet backbone traffic that reflects the predominance of short packets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. A. Marsan, A. Bianco, E. Leonardi, and L. Mila, “RPA: A flexible scheduling algorithm for input buffered switches,” IEEE Trans. On Communications, vol. 47, no. 12, Dec. 1999, pp. 1921–1933.
A. Mekkittikul, and N. McKeown “A starvation free algorithm for achieving 100% throughput in an input queued switch,” in Proc. ICCCN’96, Rockville, MA, Oct. 1996, pp. 226–229
Karol, M., Hluchyj, M. and Morgan, S. “Input versus output queueing on a space dividion switch,” IEEE Trans. Communications, Dec., pp. 1347–1356, 1987.
N. McKeown, V. Anantharam, and J. Walrand, “Achieving 100% throughput in an input-queued switch,” in Proc. IEEE INFOCOM’ 96, San Francisco, CA. pp. 296–302.
N. Mckeown, Scheduling algorithms for input-queued cell switches, Ph.D. thesis, UC Berkeley, 1995.
V. Paxson, “Fast approximation of self-similar network traffic,” Tech. Rep. LBL-36750/UC-405, April 1995
K. Claffy, G. Miller, and K. Thompson, The nature of the beast: Recent Traffic measurements from an Internet backbone.[Online]. Available: http://www.caida.org/outreach/papers/1998/Inet98/)
N. McKeown and A. Mekkittikul, “A practical scheduling algorithm to achieve 100% throughput in input queued switches,” in Proc. IEEE INFOCOM’98, San Francisco, CA, April 1998, vol. 2, pp. 792–799.
T. Anderson, S. Owicki, J. Saxe, and C. Thacker, “High speed switch scheduling for local area networks,” ACM Trans. On Computer Systems, Nov. 1993.
R. LaMaire and D. Serpanos, “Two dimensional round-robin schedulers for packet switches with multiple input queues,” IEEE/ACM Trans. Networking, vol. 2, pp. 471–482, Oct. 1994.
H. Duan, J. Lockwood, S. Kand, and J. Will, “A high performance OC12/OC48 queue design prototype for input buffered ATM switches,” in Proc. IEEE INFOCOM’ 97, Kobe, Japan, Mar. 1997, vol. 1, pp. 20–28.
N. Mckeown, P. Varaiya, and J. Walrand, “Scheduling cells in an input-queued switch,” Electron. Lett., vol. 29, no. 25, pp. 2174–2175, Dec. 1993.
N. McKeown, et. al, “The tiny Tera: A small high-bandwidth packet switch core,” IEEE Micro, Jan–Feb. 1997.
D.N. Serpanos and P.I. Antoniadis “FIRM: A Class of Ditributed Scheduling Algorithms for high-speed ATM switches with Multiple input queues,” IEEE INFOCOM 2000, pages 548–555, 2000
R. Schoen, G. Post, and G. Sander, “Weighted arbitration algorithms with priorities for input-queued switches with 100% throughput,” Proceedings of IEEE Broadband Switching Systems, 1999.
M. J. Karol, M. G. Hluchyj and S. P. Morgan, “Input versus output queueing switch,” IEEE Journal on Selected Areas in Communications, Vol. 9, No. 7, Sep. 1991, pp. 1347–1355.
Yijun Xiong, Marc Vandenhoute, and Hakki C. Cankaya, “Control Architecture in Optical Burst-Switched WDM Networks,” IEEE Journal on Selected Areas in Communications, Vol. 18, No. 10, Oct. 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, S., Chong, I. (2002). A Packet-Aware Non-interleaving Scheduling Algorithm with Multiple Classes for Input-Queued Switch. In: Chong, I. (eds) Information Networking: Wired Communications and Management. ICOIN 2002. Lecture Notes in Computer Science, vol 2343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45803-4_22
Download citation
DOI: https://doi.org/10.1007/3-540-45803-4_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44256-1
Online ISBN: 978-3-540-45803-6
eBook Packages: Springer Book Archive