Abstract
We present two new scheduling algorithms, the Maximal Matching with Random Selection (MMRS) and the Maximal Matching with Round-Robin Selection (MMRRS). These algorithms provide high throughput and fair access in a packet switch that uses multiple input queues. They are based on finding a maximal matching between input and output ports without iterations. Simulations performed show that for large load these algorithms perform better than other iterative algorithms.
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
Karol, M.K., Hluchyj, M., Morgan, S.: Input versus output queuing on a spacedivision packet switch. IEEE Trans. Commun. 35, 1347–1356 (1987)
Anderson, T., et al.: High-speed switch scheduling for local-area networks. ACM Trans. Comp. Syst. 11, 319–352 (1993)
Chao, H.J., Lam, C.H., Oki, E.: Broadband Packet Switching Technologies: A Practical Guide to ATM Switches in IP Routers. Willey, New York (2001)
Chao, H.J.: Next generation routers. Proc. of the IEEE 90, 1510–1558 (2002)
McKeown, N., Varaiya, P., Warland, J.: Scheduling cells in an input-queued switch. IEE Electronics Letters 29, 2174–2175 (1993)
McKeown, N.: The iSLIP scheduling algorithm for input-queued switches. IEEE/ACM Trans. Network. 7, 188–200 (1999)
Chao, H.J.: Saturn: A terabit packet switch using dual round-robin. IEEE Commun. Mag. 38, 78–84 (2002)
Yoshigoe, K., Christensen, K.J.: An evolution to crossbar switches with virtual ouptut queuing and buffered cross points. IEEE Network 17, 48–56 (2003)
McKeown, N., Mekkittikul, A., Anantharam, V., Walrand, J.: Achieving 100% throughput in input-queued switches. IEEE Trans. Commun. 47, 1260–1267 (1999)
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
Baranowska, A., Kabaciński, W. (2004). The New Packet Scheduling Algorithms for VOQ Switches. In: de Souza, J.N., Dini, P., Lorenz, P. (eds) Telecommunications and Networking - ICT 2004. ICT 2004. Lecture Notes in Computer Science, vol 3124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27824-5_95
Download citation
DOI: https://doi.org/10.1007/978-3-540-27824-5_95
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22571-3
Online ISBN: 978-3-540-27824-5
eBook Packages: Springer Book Archive