Skip to main content

Stationary Analysis and Optimal Control Under Multiple Working Vacation Policy in a GI/M(a,b)/1 Queue

Journal of Systems Science and Complexity volume 31, pages 1003–1023 (2018)Cite this article

Abstract

This paper considers an infinite buffer renewal input queue with multiple working vacation policy wherein customers are served by a single server according to general bulk service (a, b)-rule (1 ≤ a ≤ b). If the number of waiting customers in the system at a service completion epoch (during a normal busy period) is lower than ‘a’, then the server starts a vacation. During a vacation if the number of waiting customers reaches the minimum threshold size ‘a’, then the server starts serving this batch with a lower rate than that of the normal busy period. After completion of a batch service during working vacation, if the server finds less than ‘a’ customers accumulated in the system, then the server takes another vacation, otherwise the server continues to serve the available batch with that lower rate. The maximum allowed size of a batch in service is ‘b’. The authors derive both queue-length and system-length distributions at pre-arrival epoch using both embedded Markov chain approach and the roots method. The arbitrary epoch probabilities are obtained using the classical argument based on renewal theory. Several performance measures like average queue and system-length, mean waiting-time, cost and profit optimization are studied and numerically computed.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

USD 39.95

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

References

  1. Chaudhry M L and Templeton J G C, A First Course in Bulk Queues, Wiley, New York, 1983.

    MATH  Google Scholar 

  2. Medhi J, Recent Developments in Bulk Queueing Models, Wiley Eastern Limited, New Delhi, 1984.

    Google Scholar 

  3. Bailey N T J, On queueing processes with bulk service, Journal of the Royal Statistical Society. Series B (Methodological), 1954, 16(1): 80–87.

    MathSciNet  MATH  Google Scholar 

  4. Neuts M F, A general class of bulk queues with Poisson input, The Annals of Mathematical Statistics, 1967, 38(3): 759–770.

    MathSciNet  Article  MATH  Google Scholar 

  5. Easton G D and Chaudhry M L, The queueing system E k/M (a, b)/1 and its numerical analysis, Computers & Operations Research, 1982, 9(3): 197–205.

    Article  Google Scholar 

  6. Chaudhry M L, Madill B R, and Briere G, Computational analysis of steady-state probabilities of M/G (a, b)/1 and related nonbulk queues, Queueing Systems, 1987, 2(2): 93–114.

    MathSciNet  Article  MATH  Google Scholar 

  7. Madill B R and Chaudhry M L, Waiting-time moments in the queueing system GI/M (a, b)/1, INFOR: Information Systems and Operational Research, 1986, 24(4): 309–318.

    MATH  Google Scholar 

  8. Tian N and Zhang Z G, Vacation Queueing Models: Theory and Applications, Tailieu Vn, 2006.

    Book  MATH  Google Scholar 

  9. Ke J, Wu C, and Zhang Z G, Recent developments in vacation queueing models: A short survey, International Journal of Operations Research, 2010, 7(4): 3–8.

    Google Scholar 

  10. Gupta U C and Karabi S, The finite-buffer M/G/1 queue with general bulk-service rule and single vacation, Performance Evaluation, 2004, 57(2): 199–219.

    Article  Google Scholar 

  11. Choi B D and Han D H, G/M (a, b)/1 queues with server vacations, Journal of the Operations Research Society of Japan, 1994, 37(3): 171–181.

    MathSciNet  Article  MATH  Google Scholar 

  12. Arumuganathan R and Jeyakumar S, Steady state analysis of a bulk queue with multiple vacations, setup times with N-policy and closedown times, Applied Mathematical Modelling, 2005, 29(10): 972–986.

    Article  MATH  Google Scholar 

  13. Haridass M and Arumuganathan R, Analysis of an M X/G (a, b)/1 queueing system with vacation interruption, RAIRO — Operations Research, 2012, 46(4): 305–334.

    MathSciNet  Article  MATH  Google Scholar 

  14. Banik A D, Gupta U C, and Chaudhry M L, Finite-buffer bulk service queue under Markovian service process: GI/MSP (a, b)/1/N, Stochastic Analysis and Applications, 2009, 27(3): 500–522.

    MathSciNet  Article  MATH  Google Scholar 

  15. Chaudhry M L, Banik A D, Pacheco A, et al., A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method: GI/C − MSP (a, b)/1/∞, RAIRO — Operations Research, 2015, 50(3): 519–551.

    MathSciNet  Article  MATH  Google Scholar 

  16. Goswami V and Laxmi P V, Performance analysis of a renewal input bulk service queue with accessible and nonaccessible batches, Quality Technology and Quantitative Management, 2011, 8: 87–100.

    Article  Google Scholar 

  17. Chaudhry M L, Harris C M, and Marchal W G, Robustness of root finding in single-server queueing models, ORSA Journal on Computing, 1990, 2(3): 273–286.

    Article  MATH  Google Scholar 

  18. Ni Q, L T J, Turletti T, et al., AFR partial MAC proposal for IEEE 802.11n, IEEE 802.11-04-0950–00-000n, 2004.

    Google Scholar 

  19. Xiao Y and Rosdahl J, Throughput and delay limits of IEEE 802.11, IEEE Communications Letters, 2002, 6(8): 355–357.

    Article  Google Scholar 

  20. Skordoulis D, Ni Q, Chen H H, et al., IEEE 802.11n MAC frame aggregation mechanisms for next-generation high-throughput WLANs, IEEE Wireless Communications, 2008, 15(1): 40–47.

    Article  Google Scholar 

  21. Takács L, Introduction to the Theory of Queues, Oxford University Press, New York, 1962.

    MATH  Google Scholar 

  22. Baba Y, Analysis of a GI/M/1 queue with multiple working vacations, Operations Research Letters, 2005, 33(2): 201–209.

    MathSciNet  Article  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank Dr. N K Jana, School of Mathematical Sciences, National Institute of Science Education and Research Bhubaneswar for his help to improve the language of presentation of the paper. We would also like to thank three anonymous referees for their insightful and constructive comments that helped us to upgrade the standard of the paper. Also, the authors would like to thank Dr. A K Ojha, School of Basic Sciences, Indian Institute of Technology Bhubaneswar for his thorough language editing before submitting the second revised version of this paper.

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, National Institute of Science Education and Research, Bhubaneswar, 752050, India

    Gopinath Panda

  2. School of Basic Sciences, Indian Institute of Technology, Bhubaneswar, 752050, India

    Abhijit Datta Banik

  3. International Management Institute, Kolkata, 700027, India

    Dibyajyoti Guha

Authors
  1. Gopinath Panda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abhijit Datta Banik
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dibyajyoti Guha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gopinath Panda.

Additional information

This paper was recommended for publication by Editor WANG Shouyang.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Panda, G., Banik, A.D. & Guha, D. Stationary Analysis and Optimal Control Under Multiple Working Vacation Policy in a GI/M(a,b)/1 Queue. J Syst Sci Complex 31, 1003–1023 (2018). https://doi.org/10.1007/s11424-017-6172-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-017-6172-y

Keywords

  • Bulk service
  • cost optimization
  • mean idle period
  • multiple working vacations
  • roots method
  • system-length