Abstract
A packet-aware non-interleaving scheduling algorithm is proposed and examined in this paper. The non-interleaving scheduling algorithm eliminates the complexity of packet reassembly at the output queue. The characteristics of packet latency and queue occupancies are investigated in comparison with the cell-interleaving scheduling algorithm. The simulated results show that the packet-aware non-interleaving scheduling could be a feasible or better choice for packet switch implementations in the latency, output buffer requirement and implementation complexity viewpoints. 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
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.
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.
M. Hluchyj, and M. Karol, “Queueing in High Performance Packet Switching,” IEEE SAC-6.9, pp. 1587–1597, Dec. 1988.
R. Schoen, G. Post, and G. Sander, “Weighted arbitration algorithms with priorities for input-queued switches with 100% throughput,” in Proceedings of IEEE Broadband Switching Systems, 1999.
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.
N. McKeown, “Scheduling algorithms for input-queued cell switches,” Ph.D. Thesis, University of California at Berkeley, 1995.
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, “The iSLIP Scheduling Algorithm for Input-Queued Switches,” IEEE/ACM Trans. Networking, vol. 7, no. 2, pp. 188–201, April 1999.
D.N. Serpanos and P.I. Antoniadis “FIRM: A Class of Distributed Scheduling Algorithms for high-speed ATM switches with Multiple input queues,” IEEE INFOCOM 2000, pages 548–555, 2000
Y. Tamir, H.-C. Chi, “Symmetric Cross Bar Arbiters for VLSI Communication Switches,” IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 1, Jan. 1993, pp. 13–27.
A. Mekkittikul, N. McKeown, “A practical scheduling algorithm to achieve 100% throughput in input-queued switches”, IEEE INFOCOM’98, vol. 2, 1998, pp. 792–799
A. Mekkittikul, “Scheduling Non-uniform Traffic in High Speed Packet Switches and Routers,” Ph.D. Thesis, Stanford University, Nov.1998
V. Paxson, “Fast approximation of self-similar network traffic,” Tech. Rep. LBL-36750/UC-405, April 1995
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.
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/)
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
Hong, YK., Lee, S., Lee, HH. (2002). Shortest and Oldest First Non-interleaving Packet Switching Scheduling Algorithm. 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_21
Download citation
DOI: https://doi.org/10.1007/3-540-45803-4_21
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