Abstract
Recent developments in computer and communication networks require scheduling decisions to be made under increasingly complex system dynamics. We model and analyze the problem of packet transmissions through an arbitrary network of buffered queues, and provide a framework for describing routing and migration. This paper introduces an intuitive geometric description of stability for these networks and describes some simple algorithms which lead to maximal throughput. We show how coordination over sequential timeslots by algorithms such as those based on a round robin can provide considerable advantages over a randomized scheme.
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
Andrews, M., Awerbuch, B., Fernandez, A., Kleinberg, J., Leighton, T., Liu, Z.: Universal stability results for greedy contention-resolution progocols. In: Proc. IEEE Conf. Foundations Computer Science, pp. 380–389 (1996)
Andrews, M., Zhang, L.: Achiving stability in networks of input-queued switches. ACM/IEEE Trans. on Networking 11(5), 848–857 (2003)
Armony, M., Bambos, N.: Queueing Dynamics and Maximal Throughput Scheduling in Switched Processing Systems. Queueing Systems 44(3), 209 (2003)
Dai, J.G., Prabhakar, P.: The throughput of data switches with and without speedup. In: IEEE INFOCOM 2000, pp. 556–564 (2000)
Gamarnik, D.: Using fluid models to prove stability of adversarial queueing networks. IEEE Trans. on Automatic Control, 45(4), 741–746 (2000)
McKeown, N., Mekkittikul, A., Anantharam, V., Walrand, J.: Achieving 100% throughput in an input-queued switch. IEEE Transactions on Communications 47(8), 1260–1267 (1999)
Ross, K., Bambos, N.: Local Search Scheduling Algorithms for Maximal Throughput in Packet Switches. In: IEEE INFOCOM (2004)
Ross, K., Bambos, N.: Optimizing Quality of Service in Packet Switch Scheduling. In: IEEE ICC Conference Proceedings (2004)
Walrand, J.: An Introduction to Queueing Networks. Prentice Hall, Englewood Cliffs (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ross, K., Bambos, N. (2005). Packet Scheduling Across Networks of Switches. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31956-6_100
Download citation
DOI: https://doi.org/10.1007/978-3-540-31956-6_100
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25339-6
Online ISBN: 978-3-540-31956-6
eBook Packages: Computer ScienceComputer Science (R0)