Skip to main content

Admission Control to an M/M/1 Queue with Partial Information

  • Conference paper
Analytical and Stochastic Modeling Techniques and Applications (ASMTA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7984))

Abstract

We consider both cooperative as well as non-cooperative admission into an M/M/1 queue. The only information available is a signal that says whether the queue size is smaller than some L or not. We first compute the globally optimal and the Nash equilibrium stationary policy as a function of L. We compare the performance to that of full information on the queue size. We identify the L that optimizes the equilibrium performance.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Naor, P.: On the regulation of queueing size by levying tolls. Econometrica 37, 15–24 (1969)

    Article  MATH  Google Scholar 

  2. Yechiali, U.: On optimal balking rules and toll charges in a GI|M|1 queueing process. Operations Research 19, 349–370 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  3. Stidham, S., Weber, R.: Monotonic and insensitive optimal policies for control of queues with undiscounted costs. Operations Research 37, 611–625 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  4. Stidham, S., Rajagopal, S., Kulkarni, V.G.: Optimal flow control of a stochastic fluid-flow system. IEEE Journal on Selected Areas in Communications 13, 1219–1228 (1995)

    Article  Google Scholar 

  5. Hsiao, M.T., Lazar, A.A.: Optimal decentralized flow control of Markovian queueing networks with multiple controllers. Performance Evaluation 13, 181–204 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  6. Korilis, Y.A., Lazar, A.: On the existence of equilibria in noncooperative optimal flow control. Journal of the ACM 42(3), 584–613 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  7. Altman, E., Shimkin, N.: Individual equilibrium and learning in processor sharing systems. Operations Research 46, 776–784 (1998)

    Article  MATH  Google Scholar 

  8. Hordijk, A., Spieksma, F.: Constrained admission control to a queueing system. Advances in Applied Probability 21, 409–431 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  9. Altman, E., Gaujal, B., Hordijk, A.: Admission control in stochastic event graphs. IEEE Automatic Control 45(5), 854–867 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. Stidham, S.: Optimal control of admission to a queueing system. IEEE Transactions on Automatic Control 30, 705–713 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  11. Spieksma, F.: Geometrically Ergodic Markov Chains and the Optimal Control of Queues. PhD thesis, Leiden University (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Altman, E., Jiménez, T. (2013). Admission Control to an M/M/1 Queue with Partial Information. In: Dudin, A., De Turck, K. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2013. Lecture Notes in Computer Science, vol 7984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39408-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39408-9_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39407-2

  • Online ISBN: 978-3-642-39408-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics