Advertisement

M/M/1/1 Retrial Queues with Setup Time

  • Tuan Phung-Duc
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 383)

Abstract

This paper considers single server retrial queues with setup time. In the basic model, if the server completes a service and there are no customers in the orbit, the server is turned off immediately. Arriving customers that see the server occupied join the orbit and repeat their attempt after some random time. The new feature of our models is that an arriving customer that sees the server off waits at the server and the server is turned on. The server needs some setup time to be active so as to serve the waiting customer. If the server completes a service and the orbit is not empty, it stays idle waiting for either a new customer or a customer from the orbit. For this model, we obtain explicit expressions for the generating functions of the joint queue length. We then consider an extended model where the server stays idle for a while before being turned off for which explicit solution is also obtained.

Keywords

M/M/1/1 retrial queue Setup time Power-saving 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Artalejo, J.R.: Analysis of an M/G/1 queue with constant repeated attempts and server vacations. Computers and Operations Research 24(6), 493–504 (1997)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Barroso, L.A., Holzle, U.: The case for energy-proportional computing. Computer 40(12), 33–37 (2007)CrossRefGoogle Scholar
  3. 3.
    Bischof, W.: 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 (2001)Google Scholar
  4. 4.
    Do, T.V.: M/M/1 retrial queue with working vacations. Acta Informatica 47(1), 67–75 (2010)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Phung-Duc, T., Masuyama, H., Kasahara, S., Takahashi, Y.: M/M/3/3 and M/M/4/4 retrial queues. Journal of Industrial and Management Optimization 5(3), 431 (2009)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Phung-Duc, T., Masuyama, H., Kasahara, S., Takahashi, Y.: State-dependent M/M/c/c+ r retrial queues with Bernoulli abandonment. Journal of Industrial and Management Optimization 6(3), 517–540 (2010)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Phung-Duc, T.: An explicit solution for a tandem queue with retrials and losses. Operational Research 12(2), 189–207 (2012)CrossRefGoogle Scholar
  8. 8.
    Phung-Duc, T.: Impatient customers in power-saving data centers. In: Sericola, B., Telek, M., Horváth, G. (eds.) ASMTA 2014. LNCS, vol. 8499, pp. 185–199. Springer, Heidelberg (2014) CrossRefGoogle Scholar
  9. 9.
    Phung-Duc, T.: Server farms with batch arrival and staggered setup. In: Proceedings of the Fifth Symposium on Information and Communication Technology, pp. 240–247. ACM (2014)Google Scholar
  10. 10.
    Phung-Duc, T.: Exact solution for M/M/\(c\)/Setup queue (2014). Preprint: http://arxiv.org/abs/1406.3084
  11. 11.
    Phung-Duc, T.: Multiserver queues with finite capacity and setup time. In: Remke, A., Manini, D., Gribaudo, M. (eds.) ASMTA 2015. LNCS, vol. 9081, pp. 173–187. Springer, Heidelberg (2015) CrossRefGoogle Scholar
  12. 12.
    Takagi, H.: Priority queues with setup times. Operations Research 38(4), 667–677 (1990)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Mathematical and Computing SciencesTokyo Institute of TechnologyMeguro-ku, TokyoJapan

Personalised recommendations