Years and Authors of Summarized Original Work
-
2004; Azar, Richter, Albers, Schmidt
Problem Definition
A multi-queue network switch serves m incoming queues by transmitting data packets arriving at m input ports through one single output port. In each time step, an arbitrary number of packets may arrive at the input ports, but only one packet can be passed through the common output port. Each packet is marked with a value indicating its priority in the Quality of Service (QoS) network. Since each queue has bounded capacity B and the rate of arriving packets can be much higher than the transmission rate, packets can be lost due to insufficient queue space. The goal is to maximize the throughput which is defined as the total value of transmitted packets. The problem comprises two dependent questions: buffer management, namely which packets to admit into the queues, and scheduling, i.e., which (FIFO) queue to use for transmission in each time step.
Two scenarios are distinguished: (a) unit...
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
Recommended Reading
Albers S, Schmidt M (2005) On the performance of greedy algorithms in packet buffering. SIAM J Comput 35:278–304
Andelman N, Mansour Y, Zhu A (2003) Competitive queueing policies for QoS switches. In: Proceedings of the 14th ACM-SIAM symposium on discrete algorithms (SODA), pp 761–770
Azar Y, Litichevskey M (2004) Maximizing throughput in multiqueue switches. In: Proceedings of the 12th annual European symposium on algorithms (ESA), pp 53–64
Azar Y, Richter Y (2003) Management of multi-queue switches in QoS networks. In: Proceedings of the 35th ACM symposium on theory of computing (STOC), pp 82–89
Azar Y, Richter Y (2004) The zero-one principle for switching networks. In: Proceedings of the 36th ACM symposium on theory of computing (STOC), pp 64–71
Azar Y, Richter Y (2004) An improved algorithm for CIOQ switches. In: Proceedings of the 12th annual European symposium on algorithms (ESA). LNCS, vol 3221, pp 65–76
Bansal N, Fleischer L, Kimbrel T, Mahdian M, Schieber B, Sviridenko M (2004) Further improvements in competitive guarantees for QoS buffering. In: Proceedings of the 31st international colloquium on automata, languages, and programming (ICALP), pp 64–71
Lotker Z, Patt-Shamir B (2003) Nearly optimal FIFO buffer management for two packet classes. Comput Netw 42(4):481–492
Schmidt M (2005) Packet buffering: randomization beats deterministic algorithms. In: Proceedings of the 22nd annual symposium on theoretical aspects of computer science (STACS). LNCS, vol 3404, pp 293–304
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Schmidt, M. (2016). Packet Switching in Multi-queue Switches. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_274
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_274
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering