Article

Management of multi-queue switches in QoS networks

Authors:

Yossi Azar,

Yossi RichterAuthors Info & Claims

STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Pages 82 - 89

https://doi.org/10.1145/780542.780556

Published: 09 June 2003 Publication History

Get Access

Abstract

The concept of Quality of Service (QoS) networks has gained growing attention recently, as the traffic volume in the Internet constantly increases, and QoS guarantees are essential to ensure proper operation of most communication based applications. A QoS switch serves m incoming queues by transmitting packets arriving at these queues through one output port, one packet per time unit. Each packet is marked with a value indicating its guaranteed quality of service. Since the queues have bounded capacity 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 total value of transmitted packets. This problem encapsulates two dependent questions: admission control, namely which packets to discard in case of queue overflow, and scheduling, i.e. which queue to use for transmission in each time unit. We use competitive analysis to study online switch performance in QoS based networks. Specifically, we provide a novel generic technique that decouples the admission control and scheduling problems. Our technique transforms any single queue admission control strategy (preemptive or nonpreemptive) to a scheduling and admission control algorithm for our general m queues model, whose competitive ratio is at most twice the competitive ratio of the given admission control strategy. We use our technique to derive concrete algorithms for the general preemptive and nonpreemptive cases, as well as for the interesting special cases of the 2-value model and the unit value model. To the best of our knowledge this is the first result combining both scheduling and admission control decisions for arbitrary packets sequences in multi-queue switches. We also provide a 1.58-competitive randomized algorithm for the unit value case. This case is interesting by itself since most current networks (e.g. IP networks) only support a best-effort service in which all packets streams are treated equally.

References

[1]

W. A. Aiello, Y. Mansour, S. Rajagopolan, and A. Rosen. Competitive queue policies for differentiated services. In Proceedings of the IEEE INFOCOM 2000, pages 431--440.]]

Crossref

Google Scholar

[2]

N. Andelman, Y. Mansour, and A. Zhu. Competitive queueing policies for QoS switches. In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, pages 761--770, 2003.]]

Digital Library

Google Scholar

[3]

A. Bar-Noy, A. Freund, S. Landa, and J. Naor. Competitive on-line switching policies. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, pages 525--534, 2002.]]

Digital Library

Google Scholar

[4]

A. Birman, H. R. Gail, S. L. Hantler, Z. Rosberg, and M. Sidi. An optimal service policy for buffer systems. Journal of the Association Computing Machinery (JACM), 42(3):641--657, 1995.]]

Digital Library

Google Scholar

[5]

A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.]]

Digital Library

Google Scholar

[6]

M. Chrobak, J. Csirik, C. Imreh, J. Noga, J. Sgall, and G. J. Woeginger. The buffer minimization problem for multiprocessor scheduling with conflicts. In Proc. 28th International Colloquium on Automata, Languages, and Programming, pages 862--874, 2001.]]

Digital Library

Google Scholar

[7]

E. L. Hahne, A. Kesselman, and Y. Mansour. Competitive buffer management for shared-memory switches. In Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 53--58, 2001.]]

Digital Library

Google Scholar

[8]

R. Karp, U. Vazirani, and V. Vazirani. An optimal algorithm for on-line bipartite matching. In Proceedings of 22nd Annual ACM Symposium on Theory of Computing, pages 352--358, may 1990.]]

Digital Library

Google Scholar

[9]

A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, and M. Sviridenko. Buffer overflow management in QoS switches. In Proc. 33rd ACM Symp. on Theory of Computing, pages 520--529, 2001.]]

Digital Library

Google Scholar

[10]

A. Kesselman and Y. Mansour. Loss-bounded analysis for differentiated services. In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, pages 591--600, 2001.]]

Digital Library

Google Scholar

[11]

H. Koga. Balanced scheduling toward loss-free packet queuing and delay fairness. In Proc. 12th Annual International Symposium on Algorithms and Computation, pages 61--73, 2001.]]

Digital Library

Google Scholar

[12]

Z. Lotker and B. Patt-Shamir. Nearly optimal fifo buffer management for diffserv. In Proc. 21st ACM Symp. on Principles of Distrib. Computing, pages 134--143, 2002.]]

Digital Library

Google Scholar

[13]

M. May, J. C. Bolot, A. Jean-Marie, and C. Diot. Simple performance models of differentiated services for the internet. In Proceedings of the IEEE INFOCOM 1999, pages 1385--1394.]]

Crossref

Google Scholar

Cited By

View all

Schmidt M(2016)Packet Switching in Multi-queue SwitchesEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_274(1503-1506)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_274
Beckmann APudlák PThapen N(2014)Parity Games and Propositional ProofsACM Transactions on Computational Logic10.1145/257982215:2(1-30)Online publication date: 2-May-2014
https://dl.acm.org/doi/10.1145/2579822
Chatterjee KDoyen L(2014)Partial-Observation Stochastic GamesACM Transactions on Computational Logic10.1145/257982115:2(1-44)Online publication date: 2-May-2014
https://dl.acm.org/doi/10.1145/2579821
Show More Cited By

Index Terms

Management of multi-queue switches in QoS networks
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

An improved algorithm for CIOQ switches

The problem of maximizing the weighted throughput in various switching settings has been intensively studied recently through competitive analysis. To date, the most general model that has been investigated is the standard CIOQ (Combined Input and ...
Management of Multi-Queue Switches in QoS Networks

The concept of Quality of Service (QoS) networks has gained growing attention recently, as the traffic volume in the Internet constantly increases, and QoS guarantees are essential to ensure proper operation of most communication-based applications. A QoS ...
Maximizing throughput in multi-queue switches

We study a basic problem in Multi-Queue switches. A switch connectsm input ports to a single output port. Each input port is equipped with an incoming FIFO queue with bounded capacityB. A switch serves its input queues by transmitting packets arriving ...

Comments

Information & Contributors

Information

Published In

STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

June 2003

740 pages

ISBN:1581136749

DOI:10.1145/780542

Conference Chair:
Lawrence L. Larmore
University of Nevada Las Vegas, Las Vegas, NV
,
Program Chair:
Michel X. Goemans
Massachusetts Institute of Technology, Cambridge, MA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 June 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

STOC03

Sponsor:

STOC03: The 35th Annual ACM Symposium on Theory of Computing

June 9 - 11, 2003

CA, San Diego, USA

Acceptance Rates

STOC '03 Paper Acceptance Rate 80 of 270 submissions, 30%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

45
Total Citations
View Citations
613
Total Downloads

Downloads (Last 12 months)12
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Schmidt M(2016)Packet Switching in Multi-queue SwitchesEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_274(1503-1506)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_274
Beckmann APudlák PThapen N(2014)Parity Games and Propositional ProofsACM Transactions on Computational Logic10.1145/257982215:2(1-30)Online publication date: 2-May-2014
https://dl.acm.org/doi/10.1145/2579822
Chatterjee KDoyen L(2014)Partial-Observation Stochastic GamesACM Transactions on Computational Logic10.1145/257982115:2(1-44)Online publication date: 2-May-2014
https://dl.acm.org/doi/10.1145/2579821
Jakobsen MHornbÆk K(2014)Up close and personalACM Transactions on Computer-Human Interaction10.1145/257609921:2(1-34)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1145/2576099
Dombrowski LHayes GMazmanian MVoida A(2014)E-government intermediaries and the challenges of access and trustACM Transactions on Computer-Human Interaction10.1145/255998521:2(1-22)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1145/2559985
Church KCherubini MOliver N(2014)A large-scale study of daily information needs captured in situACM Transactions on Computer-Human Interaction10.1145/255219321:2(1-46)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1145/2552193
Eisner CFisman DHavlicek J(2014)Safety and Liveness, Weakness and Strength, and the Underlying Topological RelationsACM Transactions on Computational Logic10.1145/253244015:2(1-44)Online publication date: 2-May-2014
https://dl.acm.org/doi/10.1145/2532440
Echenim MPeltier N(2013)Instantiation Schemes for Nested TheoriesACM Transactions on Computational Logic10.1145/2480759.248076314:2(1-34)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1145/2480759.2480763
Giesen JJaggi MLaue S(2012)Approximating parameterized convex optimization problemsACM Transactions on Algorithms10.1145/2390176.23901869:1(1-17)Online publication date: 26-Dec-2012
https://dl.acm.org/doi/10.1145/2390176.2390186
Chekuri CClarkson KHar-Peled S(2012)On the set multicover problem in geometric settingsACM Transactions on Algorithms10.1145/2390176.23901859:1(1-17)Online publication date: 26-Dec-2012
https://dl.acm.org/doi/10.1145/2390176.2390185
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

An improved algorithm for CIOQ switches