Skip to main content

Convexity Results for Queueing System with Variable Service Rate

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

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

Abstract

In this paper we consider a single server queueing system with variable service rate. If the number of customers in system is less than a threshold, the service rate is set in a low value and it also can be switched to a high value once the number reaches to the threshold. We study five performance measures: the probability that the system is empty, the expected number in system and in queue, as well as the expected sojourn time in system and waiting time in queue. And we primarily show that these performance measures have the monotonicity or convexity with respect to the traffic intensity. These results are useful to the optimization problem in queueing system.

This work was supported by the National Natural Science Foundation of China (Nos. 11171019, 71390334), and the Program for New Century Excellent Talents in University (NCET-11-0568).

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. Rolfe, A.J.: A Note on Marginal Allocation in Multiple-Server Service Systems. Management Science 16, 656–658 (1971)

    Article  Google Scholar 

  2. Dyer, M.E., Proll, L.G.: On the Validity of Marginal Analysis for Allocating Servers in M/M/C Queues. Management Science 23, 1019–1022 (1977)

    Article  MATH  Google Scholar 

  3. Grassmann, W.: The Convexity of the Mean Queue Size of the M/M/C Queue with respect to the Traffic Intensity. Journal of Applied Probability 20, 916–919 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  4. Lee, H.L., Cohen, M.A.: A Note on the Convexity of Performance Measures of M/M/C Queueing Systems. Journal of Applied Probability 20, 920–923 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  5. Harel, A., Zipkin, P.H.: Strong Convexity Results for Queueing System. Operations Research 35, 405–418 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  6. Harel, A., Zipkin, P.H.: Convexity Results for the Erlang Delay and Loss Formulae When the Server Unilization Is Held Constant. Operations Research 59, 1420–1426 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dimitrakopoulos, Y., Burnetas, A.: Customer Equilibrium and Optimal Strategies in an M/M/1 Queue with Dynamic Service Control. arXiv:1112.1372v1

    Google Scholar 

  8. Gross, D., Shortle, J.F., Thompson, J.M., Harris, C.M.: Fundamental of Queueing Theory. A John wiley & Sons, Inc., Publication, Hoboken (2008)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhang, X., Wang, J., Ma, Q. (2014). Convexity Results for Queueing System with Variable Service Rate. In: Sericola, B., Telek, M., Horváth, G. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2014. Lecture Notes in Computer Science, vol 8499. Springer, Cham. https://doi.org/10.1007/978-3-319-08219-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08219-6_14

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08218-9

  • Online ISBN: 978-3-319-08219-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics