Abstract
Scheduling algorithms for input-queued switches have been widely researched. It has been shown that various classes of scheduling algorithms guarantee the stability of single switches. However, recent research has demonstrated that most of these scheduling algorithms do not the guarantee stability for networks of switches. Most of the research that treats networks of switches proposes switching policies that require coordination among switches. The problem to find distributed scheduling policies that guarantee the stability of a network of switches has so far only been investigated for a policy based on a computationally very complex maximum weight matching algorithm. In this paper, we investigate a class of distributed scheduling algorithms of low complexity that are based on maximal weight matching algorithms. We prove the stability of networks of input-queued switches where each switch deploys any maximal weight matching algorithm of the defined class.
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
Ajmone, M.M., Leonardi, E., Mellia, M., Neri, F.: On the throughput achievable by isolated and interconnected input-queued switches under multicalss traffic. In: Proc. of Infocom 2002, New York City (June 2002)
Ajmone, M.M., Giaccone, P., Leonardi, E., Mellia, M., Neri, F.: Local scheduling policies in networks of packet switches with input queues. In: Proc. of Infocom 2003, San Francisco (April 2003)
Andrews, M., Zhang, L.: Achieving stability in networks of input queued. In: Proc. of Infocom 2001, Anchorage, Alaska (April 2001)
Bauer, C.: Packet scheduling in input-queued switches with a speedup of less than two. In: Proc. of IEEE International Conference on Networks, Sydney (September 2003)
Benson, K.: Throughput of crossbar switches using maximal matching algorithms. In: Proc. of IEEE ICC 2002, New York City (2002)
Dai, J.G., Prabhakar, B.: The throughput of data switches with and without speedup. In: Proc. of IEEE Infocom 2000, Tel Aviv (2000)
Leonardi, E., Mellia, M., Neri, F., Marsan, M.A.: Stability of maximal size matching scheduling in input queued cell switches. In: Prof. of IEEE ICC 2000, New Orleans (2000)
McKeown, N., Mekkittikul, A., Anantharam, V., Walrand, J.: Achieving 100% throughput in an input queued switch. IEEE Transactions on Communications 47(8), 1260–1272 (1999)
Shah, D., Kopikare, M.: Delay bounds for approximate maximum weight matching algorithms for input queued switches. In: Proc. of IEEE Infocom 2002, New York City (June 2002)
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
Bauer, C. (2004). Distributed Scheduling Policies of Low Complexity for Networks of Input-Queued 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_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-25969-5_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22262-0
Online ISBN: 978-3-540-25969-5
eBook Packages: Springer Book Archive