Skip to main content
Log in

Exact solutions for M/M/c/Setup queues

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Recently multiserver queues with setup times have been extensively studied because they have applications in power-saving data centers. A challenging model is the M/M/c/Setup queue where a server is turned off when it is idle and is turned on if there are some waiting jobs. Recently, Gandhi et al. (in: Proceedings of the ACM SIGMETRICS, pp. 153–166, ACM, 2013; Queueing Syst. 77(2):177–209, 2014) obtain the generating function of the number of jobs in the system, as well as the Laplace transform of the response time using the recursive renewal reward approach and the distributional Little’s law (Keilson and Servi in Oper Res Lett 7(5):223– 227, 1988). In this paper, we derive exact solutions for the joint stationary queue length distribution of the same model using two alternative methodologies: generating function approach and matrix analytic method. The generating function approach yields exact closed form expressions for the joint stationary queue length distribution and the conditional decomposition formula. On the other hand, the matrix analytic approach leads to an exact recursive algorithm to calculate the joint stationary distribution and performance measures so as to provide some application insights.

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  1. Artalejo, J. R., Economou, A., & Lopez-Herrero, M. J. (2005). Analysis of a multiserver queue with setup times. Queueing Systems, 51(1–2), 53–76.

    Article  Google Scholar 

  2. Barroso, L. A., & Holzle, U. (2007). The case for energy-proportional computing. Computer, 40(12), 33–37.

    Article  Google Scholar 

  3. Bischof, W. (2001). Analysis of M/G/1-queues with setup times and vacations under six different service disciplines. Queueing Systems: Theory and Applications, 39(4), 265–301.

    Article  Google Scholar 

  4. Bright, L. W., & Taylor, P. G. (1995). Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes. Stochastic Models, 11, 497–525.

    Article  Google Scholar 

  5. Burke, P. J. (1975). Delays in single-server queues with batch input. Operations Research, 23, 830–833.

    Article  Google Scholar 

  6. Choudhury, G. (1998). On a batch arrival Poisson queue with a random setup time and vacation period. Computers and Operations Research, 25(12), 1013–1026.

    Article  Google Scholar 

  7. Choudhury, G. (2000). An MX/G/1 queueing system with a setup period and a vacation period. Queueing Systems: Theory and Applications, 36(1/3), 23–38.

    Article  Google Scholar 

  8. Fuhrmann, S. W., & Cooper, R. B. (1985). Stochastic decompositions in the M/G/1 queue with generalized vacations. Operations Research, 33(5), 1117–1129.

    Article  Google Scholar 

  9. Gandhi, A., Doroudi, S., Harchol-Balter, M., & Scheller-Wolf, A. (2013). Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward. In Proceedings of the ACM SIGMETRICS (pp. 153–166). ACM.

  10. Gandhi, A., Doroudi, S., Harchol-Balter, M., & Scheller-Wolf, A. (2014). Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward. Queueing Systems, 77(2), 177–209.

    Article  Google Scholar 

  11. Gandhi, A., Harchol-Balter, M., & Adan, I. (2010). Server farms with setup costs. Performance Evaluation, 67, 1123–1138.

    Article  Google Scholar 

  12. Keilson, J., & Servi, L. D. (1988). A distributional form of Little’s law. Operations Research Letters, 7(5), 223–227.

    Article  Google Scholar 

  13. Levy, Y., & Yechiali, U. (1976). An M/M/s queue with servers’ vacations. INFOR, 14(2), 153–163.

    Google Scholar 

  14. Maccio, V. J., & Down, D. G., (2013). On optimal policies for energy-aware servers. In Proceedings of IEEE 21st International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems (MASCOTS).

  15. Mitrani, I. (2011). Service center trade-offs between customer impatience and power consumption. Performance Evaluation, 68, 1222–1231.

    Article  Google Scholar 

  16. Mitrani, I. (2013). Managing performance and power consumption in a server farm. Annals of Operations Research, 202(1), 121–134.

    Article  Google Scholar 

  17. Neuts, M. F. (1981). Matrix-geometric solutions in stochastic models: an algorithmic approach. Baltimore: Johns Hopkins University Press.

    Google Scholar 

  18. Perel, N., & Yechiali, U. (2013). The Israeli queue with priorities. Stochastic Models, 29, 353–379.

  19. Phung-Duc, T. (2014). Impatient customers in power-saving data centers. Lecture Notes in Computer Science, LNCS, 8499, 185–199.

    Article  Google Scholar 

  20. Phung-Duc, T. (2015). Multiserver queues with finite capacity and setup time. Lecture Notes in Computer Science, LNCS, 9081, 173–187.

    Article  Google Scholar 

  21. Phung-Duc, T., Masuyama, H., Kasahara, S., & Takahashi, Y., (2010). A simple algorithm for the rate matrices of level-dependent QBD processes. Proceedings of QTNA2010, Beijing, China (pp. 46–52). New York, USA: ACM.

  22. Ramaswami, V., & Taylor, P. G. (1996). Some properties of the rate operations in level dependent quasi-birth-and-death processes with countable number of phases. Stochastic Models, 12, 143–164.

    Article  Google Scholar 

  23. Schwartz, C., Pries, R., & Tran-Gia, P., (2012). A queuing analysis of an energy-saving mechanism in data centers. In Proceedings of IEEE 2012 International Conference on Information Networking (ICOIN) (pp. 70–75).

  24. Servi, L. D., & Finn, S. G. (2002). M/M/1 queues with working vacations (M/M/1/WV). Performance Evaluation, 50(1), 41–52.

    Article  Google Scholar 

  25. Takagi, H. (1990). Priority queues with setup times. Operations Research, 38(4), 667–677.

    Article  Google Scholar 

  26. Tian, N., Li, Q. L., & Gao, J. (1999). Conditional stochastic decompositions in the M/M/\(c\) queue with server vacations. Stochastic Models, 15, 367–377.

    Article  Google Scholar 

  27. Tian, N., & Zhang, Z. G. (2006). Vacation queueing models, theory and applications. New York: Springer.

    Google Scholar 

  28. Van Houdt, B., & van Leeuwaarden, J. S. H. (2011). Triangular M/G/1-type and tree-like QBD Markov chains. INFORMS Journal on Computing, 23(1), 165–171.

    Article  Google Scholar 

  29. Zhang, Z. G., & Tian, N. (2003). Analysis of queueing systems with synchronous single vacation for some servers. Queueing Systems, 45, 161–175.

    Article  Google Scholar 

Download references

Acknowledgments

The author would like to thank two anonymous referees and the associate editor whose comments helped to improve the presentation of the paper. The author would like to thank Professor Herwig Bruneel of Ghent University and Professor Onno Boxma of Eindhoven University of Technology for useful remarks on the conditional decomposition. This research was supported in part by Japan Society for the Promotion of Science, JSPS Grant-in-Aid for Young Scientists (B), Grant No. 2673001.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tuan Phung-Duc.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Phung-Duc, T. Exact solutions for M/M/c/Setup queues. Telecommun Syst 64, 309–324 (2017). https://doi.org/10.1007/s11235-016-0177-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-016-0177-z

Keywords

Navigation