Abstract
This paper presents a scalable scheduling scheme, called iterative request-grant-based round-robin (iRGRR), for input-queued switches. Most traditional iterative scheduling schemes are based on a request-grant-accept process, such as PIM and iSLIP, and suffer from poor scalability due to the large latency in control message transmission. iRGRR overcomes this limitation by simplifying the execution process and reducing the scheduling overhead. It dramatically reduces the complexity of control messages from an order of O(N) to O(log N), and is thus a scalable solution for high port density switches. The simulation results show that iRGRR can achieve nearly the same performance as iSLIP under various traffic models, including uniform and non-uniform destination distributions. In addition, iRGRR provides better fairness and has lower implementation complexity than iSLIP.
This work is supported by National “863” Plan under No. 2001AA121063.
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
Awdeh, R.Y., Mouftah, H.T.: Survey of ATM Switch Architectures. Computer Networks and ISDN Systems 27, 1567–1613 (1995)
Nong, G., Hamdi, M.: On the Provision of Quality-of-Service Gurantees for Input Queued Switches. IEEE Comm. Mag. 38(12), 62–69 (2000)
Karol, M.J., Hluchyj, M., Morgan, S.: Input Versus Output Queueing on a Space-division Packet Switch. IEEE Trans. Comm. 35, 1347–1356 (1987)
Mckeown, N., Anantharam, V., Walrand, J.: Achieving 100% Throughput in an Input-Queued Switch. In: Proceedings of IEEE Infocom, San Francisco, vol. 1, pp. 296–302 (March 1996)
Mekkittikul, A., Mckeown, N.: A Starvation-free Algorithm for Achieving 100% Throughput in an Input-Queued Switch. In: ICCCN 1996, October 1996, pp. 226–231 (1996)
Minkenberg, C.: Performance of iSLIP Scheduling with Large Round-Trip Latency. In: HPSR 2003 (June 2003)
Marsan, M.A., Bianco, A., Filippi, E., Giaccone, P., Leonardi, E., Neri, F.: On the Behavior of Input Queuing Switch Architectures. European Transactions on Telecommunications (ETT) 10(2), 111–124 (1999)
Anderson, T.E., Owicki, S.S., Saxe, J.B., Thacker, C.P.: High Speed Switch Scheduling for Local Area Networks. ACM Transactions on Computer Systems 11(4), 319–352 (1993)
Mckeown, N.: Scheduling Algorithm for Input-Queued Cell Switches. Ph.D. Thesis, UC Berkeley (May 1995)
Mckeown, N.: The iSLIP Scheduling Algorithm for Input-Queued Switches. IEEE/ACM Trans. Networking 7(2), 188–200 (1999)
Serpanos, D., Antoniadis, P.: FIRM: A Class of Distributed Scheduling Algorithms for High-Speed ATM Switches with Multiple Input Queues. In: Proceedings of IEEE INFOCOM, March 2000, pp. 548–555 (2000)
Chao, H.J., Park, J.S.: Centralized Contention Resolution Schemes for a Large- Capacity Optical ATM Switch. In: Proceeding of IEEE ATM Workshop, Fairfax, VA (May 1998)
Chao, H.J.: Saturn: A Terabit Packet Switch Using Dual Round-Robin. IEEE Comm. Mag. 38(12), 78–84 (2000)
Li, Y., Panwar, S., Chao, H.J.: Performance Analysis of a Dual Round-Robin Switch. In: Proceedings of IEEE INFOCOM, April 2001, pp. 1688–1697 (2001)
Shin, E.S., Mooney, V., Riley, G.F.: Round-robin Arbiter Design and Generation. In: Proceedings of the International Symposium on System Synthesis (ISSS 2002), pp. 243–248 (2002)
Stanford University,SIM, http://klamath.stanford.edu/tools/SIM
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peng, L., Tian, C., Zheng, S. (2004). iRGRR: A Fast Scheduling Scheme with Less Control Messages for Scalable Crossbar Switches. In: Mammeri, Z., Lorenz, P. (eds) High Speed Networks and Multimedia Communications. HSNMC 2004. Lecture Notes in Computer Science, vol 3079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25969-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-25969-5_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22262-0
Online ISBN: 978-3-540-25969-5
eBook Packages: Springer Book Archive