Skip to main content

Asymptotic Optimality of Balanced Routing in a Multiclass G/G/1 Queue

  • Conference paper
  • First Online:
  • 778 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 212))

Abstract

In this paper we consider a multiclass G/G/1 queueing system. When the server is idle, we use a balanced routing control policy to determine what kind of customer is served. Under such a balanced policy, we derive the diffusion limits of the queue length processes and the workload processes. The diffusion limits are the same for these processes regardless the choice of c as long as c ≥ 2. We further show that the proposed balanced routing policy for any fixed c ≥ 2 is asymptotically optimal in the sense that it minimizes the workload over all time in the diffusion limit.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Stolyar AL (2001) Max-weight scheduling in a generalized switch: state space collapse and workload minimization in heavy traffic. Ann Appl Probab 14x:1–53

    Google Scholar 

  2. Azar Y, Broder A, Karlin A, Upfal E (1999) Balanced allocations. SIAM J Comput 29:1180–1200

    Article  MathSciNet  MATH  Google Scholar 

  3. Vvednskaya ND, Dobrushin RL, Karpelevich FI (1996) Queueing system with selection of the shortest of two queues: an asymptotic approach. Probl Inf Transm 32:15–27

    MATH  Google Scholar 

  4. Mitzenmacher M (2001) The power of two choices in randomized load balancing. IEEE Trans Parallel Distrib Comput 12:1094–1104

    Article  Google Scholar 

  5. Chen H, Ye HQ (2012) Asymptotic optimality of balanced routing. Oper Res 60(1):163–179

    Article  MathSciNet  MATH  Google Scholar 

  6. He YT and Down DG (2008) Limited choice and locality considerations for load balancing. Perform Eval 65:670–687

    Google Scholar 

  7. Chen H, Yao DD (2001) Fundamentals of Queueing networks: performance, asymptotics, and optimization. Springer, New York

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiao Xiao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xiao, X., Wu, L. (2013). Asymptotic Optimality of Balanced Routing in a Multiclass G/G/1 Queue. In: Yin, Z., Pan, L., Fang, X. (eds) Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013. Advances in Intelligent Systems and Computing, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37502-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37502-6_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37501-9

  • Online ISBN: 978-3-642-37502-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics