American Institute of Mathematical Sciences

Advanced
July  2017, (3): 1329-1345. doi: 10.3934/jimo.2016075

Single server retrial queues with setup time

Tuan Phung-Duc

Division of Policy and Planning Sciences, Faculty of Engineering, Information and Systems, University of Tsukuba, 1-1-1 Tennodai, Tsukuba, Ibaraki 305-8573, Japan

Received  September 2015 Revised  May 2016 Published  October 2016

Fund Project: The reviewing process of the paper was handled by Wuyi Yue and Yutaka Takahashi as Guest Editors

This paper considers single server retrial queues with setup time where the server is aware of the existence of retrying customers. In the basic model, the server is switched off immediately when the system becomes empty in order to save energy consumption. 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 or retrial customer. Under the assumption that the service time and the setup time are arbitrarily distributed, we obtain explicit expressions for the generating functions of the joint queue length. We also obtain recursive formulas for computing the moments of the queue length. We then consider an extended model where the server has a closedown time before being turned off for which an explicit solution is also obtained.

Keywords: M/G/1/1 retrial queue, setup time, power-saving, closedown, moments.
Mathematics Subject Classification: 60K25, 68M20, 90B22.
Citation: Tuan Phung-Duc. Single server retrial queues with setup time. Journal of Industrial & Management Optimization, 2017, (3) : 1329-1345. doi: 10.3934/jimo.2016075
References:
[1]

J. R. Artalejo, Analysis of an M/G/1 queue with constant repeated attempts and server vacations, Computers and Operations Research, 24 (1997), 493-504. doi: 10.1016/S0305-0548(96)00076-7. Google Scholar

[2]

L. A. Barroso and U. Holzle, The case for energy-proportional computing, Computer, 40 (2007), 33-37. doi: 10.1109/MC.2007.443. Google Scholar

[3]

W. Bischof, Analysis of M/G/1-queues with setup times and vacations under six different service disciplines, Queueing Systems, 39 (2001), 265-301. doi: 10.1023/A:1013992708103. Google Scholar

[4]

S. Derkic and J. E. Stafford, Symbolic computation of moments in priority queues, INFORMS Journal on Computing, 14 (2002), 261-277. doi: 10.1287/ijoc.14.3.261.115. Google Scholar

[5]

S. Drekic, J. E. Stafford and G. E. Willmot, Symbolic calculation of the moments of the time of ruin, Insurance: Mathematics and Economics, 34 (2004), 109-120. doi: 10.1016/j.insmatheco.2003.11.004. Google Scholar

[6]

T. V. Do, M/M/1 retrial queue with working vacations, Acta Informatica, 47 (2010), 67-75. doi: 10.1007/s00236-009-0110-y. Google Scholar

[7]

G. I. Falin and J. G. C. Templeton, Retrial Queues Chapman and Hall, London, 1997.Google Scholar

[8]

A. Gandhi, M. Harchol-Balter and M. A. Kozuch, Are sleep states effective in data centers?, Proceedings of IEEE 2012 International Green Computing Conference (IGCC), (2012), 1-10. doi: 10.1109/IGCC.2012.6322260. Google Scholar

[9]

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

[10]

A. Gandhi, S. Doroudi, M. Harchol-Balter and A. Scheller-Wolf, Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward, Queueing Systems, 77 (2014), 177-209. doi: 10.1007/s11134-014-9409-7. Google Scholar

[11]

S. Kapodistria, T. Phung-Duc and J. Resing, Linear birth/immigration-death process with binomial catastrophes, Probability in the Engineering and Informational Sciences, 30 (2016), 79-111. doi: 10.1017/S0269964815000297. Google Scholar

[12]

V. J. Maccio and D. G. Down, On optimal policies for energy-aware servers, Performance Evaluation, 90 (2013), 36-52. doi: 10.1109/MASCOTS.2013.11. Google Scholar

[13]

I. Mitrani, Managing performance and power consumption in a server farm, Annals of Operations Research, 202 (2013), 121-134. doi: 10.1007/s10479-011-0932-1. Google Scholar

[14]

T. Phung-Duc, H. Masuyama, S. Kasahara and Y. Takahashi, M/M/3/3 and M/M/4/4 retrial queues, Journal of Industrial and Management Optimization, 5 (2009), 431-451. doi: 10.3934/jimo.2009.5.431. Google Scholar

[15]

T. Phung-Duc, H. Masuyama, S. Kasahara and Y. Takahashi, State-dependent M/M/c/c+ r retrial queues with Bernoulli abandonment, Journal of Industrial and Management Optimization, 6 (2010), 517-540. doi: 10.3934/jimo.2010.6.517. Google Scholar

[16]

T. Phung-Duc, An explicit solution for a tandem queue with retrials and losses, Operational Research, 12 (2012), 189-207. doi: 10.1007/s12351-011-0113-7. Google Scholar

[17]

T. Phung-Duc, Impatient customers in power-saving data centers, Lecture Notes in Computer Science, 8499 (2014), 185-199. doi: 10.1007/978-3-319-08219-6_13. Google Scholar

[18]

T. Phung-Duc, Server farms with batch arrival and staggered setup, Proceedings of the Fifth Symposium on Information and Communication Technology, (2014), 240-247. doi: 10.1145/2676585.2676613. Google Scholar

[19]

T. Phung-Duc, Exact solutions for M/M/$c$/Setup queues Telecommunication Systems 2016. doi: 10.1007/s11235-016-0177-z. Google Scholar

[20]

T. Phung-Duc, Multiserver queues with finite capacity and setup time, Lecture Notes in Computer Science, 9081 (2015), 173-187. doi: 10.1007/978-3-319-18579-8_13. Google Scholar

[21]

T. Phung-Duc, M/M/1/1 retrial queues with setup time, Advances in Intelligent Systems and Computing, 383 (2015), 93-104. doi: 10.1007/978-3-319-22267-7_9. Google Scholar

[22]

C. Schwartz, R. Pries and P. Tran-Gia, A queuing analysis of an energy-saving mechanism in data centers, Proceedings of IEEE 2012 International Conference on Information Networking (ICOIN), (2012), 70-75. doi: 10.1109/ICOIN.2012.6164352. Google Scholar

[23]

H. Takagi, Priority queues with setup times, Operations Research, 38 (1990), 667-677. doi: 10.1287/opre.38.4.667. Google Scholar

[24]

H. Takagi and K. Sakamaki, Symbolic moment calculation for the sojourn time in M/G/1 queues with Bernoulli feedback, Journal of the Operations Research Society of Japan, 42 (1999), 78-87. doi: 10.1016/S0453-4514(99)80006-4. Google Scholar

[25]

H. Takagi and K. Sakamaki, Moments for M/G/1 queues, Mathematica Journal, 6 (1996), 75-80. Google Scholar

[26]

H. Takagi and S. Kudoh, Symbolic higher-order moments of the waiting time in an M/G/1 queue with random order of service, Stochastic Models, (1997), 167-179. doi: 10.1080/15326349708807419. Google Scholar

show all references

References:
[1]

J. R. Artalejo, Analysis of an M/G/1 queue with constant repeated attempts and server vacations, Computers and Operations Research, 24 (1997), 493-504. doi: 10.1016/S0305-0548(96)00076-7. Google Scholar

[2]

L. A. Barroso and U. Holzle, The case for energy-proportional computing, Computer, 40 (2007), 33-37. doi: 10.1109/MC.2007.443. Google Scholar

[3]

W. Bischof, Analysis of M/G/1-queues with setup times and vacations under six different service disciplines, Queueing Systems, 39 (2001), 265-301. doi: 10.1023/A:1013992708103. Google Scholar

[4]

S. Derkic and J. E. Stafford, Symbolic computation of moments in priority queues, INFORMS Journal on Computing, 14 (2002), 261-277. doi: 10.1287/ijoc.14.3.261.115. Google Scholar

[5]

S. Drekic, J. E. Stafford and G. E. Willmot, Symbolic calculation of the moments of the time of ruin, Insurance: Mathematics and Economics, 34 (2004), 109-120. doi: 10.1016/j.insmatheco.2003.11.004. Google Scholar

[6]

T. V. Do, M/M/1 retrial queue with working vacations, Acta Informatica, 47 (2010), 67-75. doi: 10.1007/s00236-009-0110-y. Google Scholar

[7]

G. I. Falin and J. G. C. Templeton, Retrial Queues Chapman and Hall, London, 1997.Google Scholar

[8]

A. Gandhi, M. Harchol-Balter and M. A. Kozuch, Are sleep states effective in data centers?, Proceedings of IEEE 2012 International Green Computing Conference (IGCC), (2012), 1-10. doi: 10.1109/IGCC.2012.6322260. Google Scholar

[9]

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

[10]

A. Gandhi, S. Doroudi, M. Harchol-Balter and A. Scheller-Wolf, Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward, Queueing Systems, 77 (2014), 177-209. doi: 10.1007/s11134-014-9409-7. Google Scholar

[11]

S. Kapodistria, T. Phung-Duc and J. Resing, Linear birth/immigration-death process with binomial catastrophes, Probability in the Engineering and Informational Sciences, 30 (2016), 79-111. doi: 10.1017/S0269964815000297. Google Scholar

[12]

V. J. Maccio and D. G. Down, On optimal policies for energy-aware servers, Performance Evaluation, 90 (2013), 36-52. doi: 10.1109/MASCOTS.2013.11. Google Scholar

[13]

I. Mitrani, Managing performance and power consumption in a server farm, Annals of Operations Research, 202 (2013), 121-134. doi: 10.1007/s10479-011-0932-1. Google Scholar

[14]

T. Phung-Duc, H. Masuyama, S. Kasahara and Y. Takahashi, M/M/3/3 and M/M/4/4 retrial queues, Journal of Industrial and Management Optimization, 5 (2009), 431-451. doi: 10.3934/jimo.2009.5.431. Google Scholar

[15]

T. Phung-Duc, H. Masuyama, S. Kasahara and Y. Takahashi, State-dependent M/M/c/c+ r retrial queues with Bernoulli abandonment, Journal of Industrial and Management Optimization, 6 (2010), 517-540. doi: 10.3934/jimo.2010.6.517. Google Scholar

[16]

T. Phung-Duc, An explicit solution for a tandem queue with retrials and losses, Operational Research, 12 (2012), 189-207. doi: 10.1007/s12351-011-0113-7. Google Scholar

[17]

T. Phung-Duc, Impatient customers in power-saving data centers, Lecture Notes in Computer Science, 8499 (2014), 185-199. doi: 10.1007/978-3-319-08219-6_13. Google Scholar

[18]

T. Phung-Duc, Server farms with batch arrival and staggered setup, Proceedings of the Fifth Symposium on Information and Communication Technology, (2014), 240-247. doi: 10.1145/2676585.2676613. Google Scholar

[19]

T. Phung-Duc, Exact solutions for M/M/$c$/Setup queues Telecommunication Systems 2016. doi: 10.1007/s11235-016-0177-z. Google Scholar

[20]

T. Phung-Duc, Multiserver queues with finite capacity and setup time, Lecture Notes in Computer Science, 9081 (2015), 173-187. doi: 10.1007/978-3-319-18579-8_13. Google Scholar

[21]

T. Phung-Duc, M/M/1/1 retrial queues with setup time, Advances in Intelligent Systems and Computing, 383 (2015), 93-104. doi: 10.1007/978-3-319-22267-7_9. Google Scholar

[22]

C. Schwartz, R. Pries and P. Tran-Gia, A queuing analysis of an energy-saving mechanism in data centers, Proceedings of IEEE 2012 International Conference on Information Networking (ICOIN), (2012), 70-75. doi: 10.1109/ICOIN.2012.6164352. Google Scholar

[23]

H. Takagi, Priority queues with setup times, Operations Research, 38 (1990), 667-677. doi: 10.1287/opre.38.4.667. Google Scholar

[24]

H. Takagi and K. Sakamaki, Symbolic moment calculation for the sojourn time in M/G/1 queues with Bernoulli feedback, Journal of the Operations Research Society of Japan, 42 (1999), 78-87. doi: 10.1016/S0453-4514(99)80006-4. Google Scholar

[25]

H. Takagi and K. Sakamaki, Moments for M/G/1 queues, Mathematica Journal, 6 (1996), 75-80. Google Scholar

[26]

H. Takagi and S. Kudoh, Symbolic higher-order moments of the waiting time in an M/G/1 queue with random order of service, Stochastic Models, (1997), 167-179. doi: 10.1080/15326349708807419. Google Scholar

Figure 1.  Transitions among states
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 2.  Transition among states
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 3.  Probability of OFF state against $\alpha$ ($\rho = 0.7$)
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 4.  Mean number of jobs in orbit against $\alpha$ ($\rho = 0.7$)
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 5.  Probability of OFF state against $\alpha$ ($\rho = 0.1$)
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 6.  Mean number of jobs in orbit against $\alpha$ ($\rho = 0.1$)
Figure Options

Download full-size image

Download as PowerPoint slide

[1]

Sheng Zhu, Jinting Wang. Strategic behavior and optimal strategies in an M/G/1 queue with Bernoulli vacations. Journal of Industrial & Management Optimization, 2018, 14 (4) : 1297-1322. doi: 10.3934/jimo.2018008
[2]

Shaojun Lan, Yinghui Tang. Performance analysis of a discrete-time $ Geo/G/1$ retrial queue with non-preemptive priority, working vacations and vacation interruption. Journal of Industrial & Management Optimization, 2019, 15 (3) : 1421-1446. doi: 10.3934/jimo.2018102
[3]

Tuan Phung-Duc, Ken'ichi Kawanishi. Multiserver retrial queue with setup time and its application to data centers. Journal of Industrial & Management Optimization, 2019, 15 (1) : 15-35. doi: 10.3934/jimo.2018030
[4]

Biao Xu, Xiuli Xu, Zhong Yao. Equilibrium and optimal balking strategies for low-priority customers in the M/G/1 queue with two classes of customers and preemptive priority. Journal of Industrial & Management Optimization, 2019, 15 (4) : 1599-1615. doi: 10.3934/jimo.2018113
[5]

Dequan Yue, Wuyi Yue, Gang Xu. Analysis of customers' impatience in an M/M/1 queue with working vacations. Journal of Industrial & Management Optimization, 2012, 8 (4) : 895-908. doi: 10.3934/jimo.2012.8.895
[6]

Shan Gao, Jinting Wang. On a discrete-time GI$^X$/Geo/1/N-G queue with randomized working vacations and at most $J$ vacations. Journal of Industrial & Management Optimization, 2015, 11 (3) : 779-806. doi: 10.3934/jimo.2015.11.779
[7]

Shaojun Lan, Yinghui Tang, Miaomiao Yu. System capacity optimization design and optimal threshold $N^{*}$ for a $GEO/G/1$ discrete-time queue with single server vacation and under the control of Min($N, V$)-policy. Journal of Industrial & Management Optimization, 2016, 12 (4) : 1435-1464. doi: 10.3934/jimo.2016.12.1435
[8]

Ahmed M. K. Tarabia. Transient and steady state analysis of an M/M/1 queue with balking, catastrophes, server failures and repairs. Journal of Industrial & Management Optimization, 2011, 7 (4) : 811-823. doi: 10.3934/jimo.2011.7.811
[9]

Dequan Yue, Wuyi Yue, Guoxi Zhao. Analysis of an M/M/1 queue with vacations and impatience timers which depend on the server's states. Journal of Industrial & Management Optimization, 2016, 12 (2) : 653-666. doi: 10.3934/jimo.2016.12.653
[10]

A. Azhagappan, T. Deepa. Transient analysis of N-policy queue with system disaster repair preventive maintenance re-service balking closedown and setup times. Journal of Industrial & Management Optimization, 2017, 13 (5) : 1-14. doi: 10.3934/jimo.2019083
[11]

Jerim Kim, Bara Kim, Hwa-Sung Kim. G/M/1 type structure of a risk model with general claim sizes in a Markovian environment. Journal of Industrial & Management Optimization, 2012, 8 (4) : 909-924. doi: 10.3934/jimo.2012.8.909
[12]

Sung-Seok Ko, Jangha Kang, E-Yeon Kwon. An $(s,S)$ inventory model with level-dependent $G/M/1$-Type structure. Journal of Industrial & Management Optimization, 2016, 12 (2) : 609-624. doi: 10.3934/jimo.2016.12.609
[13]

Ruiling Tian, Dequan Yue, Wuyi Yue. Optimal balking strategies in an M/G/1 queueing system with a removable server under N-policy. Journal of Industrial & Management Optimization, 2015, 11 (3) : 715-731. doi: 10.3934/jimo.2015.11.715
[14]

Chandra Shekhar, Amit Kumar, Shreekant Varshney, Sherif Ibrahim Ammar. $ \bf{M/G/1} $ fault-tolerant machining system with imperfection. Journal of Industrial & Management Optimization, 2017, 13 (5) : 1-28. doi: 10.3934/jimo.2019096
[15]

Zhanyou Ma, Pengcheng Wang, Wuyi Yue. Performance analysis and optimization of a pseudo-fault Geo/Geo/1 repairable queueing system with N-policy, setup time and multiple working vacations. Journal of Industrial & Management Optimization, 2017, 13 (3) : 1467-1481. doi: 10.3934/jimo.2017002
[16]

Hideaki Takagi. Unified and refined analysis of the response time and waiting time in the M/M/m FCFS preemptive-resume priority queue. Journal of Industrial & Management Optimization, 2017, 13 (4) : 1945-1973. doi: 10.3934/jimo.2017026
[17]

Arnaud Devos, Joris Walraevens, Tuan Phung-Duc, Herwig Bruneel. Analysis of the queue lengths in a priority retrial queue with constant retrial policy. Journal of Industrial & Management Optimization, 2017, 13 (5) : 1-30. doi: 10.3934/jimo.2019082
[18]

Fadia Bekkal-Brikci, Giovanna Chiorino, Khalid Boushaba. G1/S transition and cell population dynamics. Networks & Heterogeneous Media, 2009, 4 (1) : 67-90. doi: 10.3934/nhm.2009.4.67
[19]

Yutaka Sakuma, Atsushi Inoie, Ken’ichi Kawanishi, Masakiyo Miyazawa. Tail asymptotics for waiting time distribution of an M/M/s queue with general impatient time. Journal of Industrial & Management Optimization, 2011, 7 (3) : 593-606. doi: 10.3934/jimo.2011.7.593
[20]

Tuan Phung-Duc, Hiroyuki Masuyama, Shoji Kasahara, Yutaka Takahashi. M/M/3/3 and M/M/4/4 retrial queues. Journal of Industrial & Management Optimization, 2009, 5 (3) : 431-451. doi: 10.3934/jimo.2009.5.431

2018 Impact Factor: 1.025

Tools

Metrics

  • PDF downloads (41)
  • HTML views (262)
  • Cited by (3)

Other articles
by authors

[Back to Top]

Copyright © 2019 American Institute of Mathematical Sciences