Skip to main content

Cost Analysis of an Unreliable Retrial Queue Subject to Balking, Bernoulli Vacation, Two Types of Service and Starting Failure

  • Conference paper
  • First Online:
Computational Intelligence, Cyber Security and Computational Models. Models and Techniques for Intelligent Systems and Automation (ICC3 2017)

Abstract

The proposed queueing model deals with a single server retrial queueing subject to balking, Bernoulli vacation, two types of service and starting failure. Single server provides two types of heterogeneous service in which the customer will choose either type 1 service or type 2 service with two different probabilities. The authors assume that, while rendering service to the arriving primary or repeated customers the server may subject to starting failure. After each service completion the server will take vacation subject to Bernoulli vacation policy. For such queueing model the necessary and sufficient condition have been derived. The model have been solved by the use of supplementary variable technique. Cost analysis have been carried out with the cost parameters. To validate the proposed model some performance measures, special cases and sensitivity analysis have been discussed.

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 EPUB and 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

References

  1. Artalejo, J.R.: Accessible bibliography on retrial queues: progress in 2000–2009. Math. Comput. Model. 51, 1071–1081 (2010)

    Article  MathSciNet  Google Scholar 

  2. Arivudainambi, D., Godhandaraman, P.: Retrial queueing system with balking, optional service and vacation. Ann. Oper. Res. 229, 67–84 (2015)

    Article  MathSciNet  Google Scholar 

  3. Arivudainambi, D., Gowsalya, M.: A single server non-markovian retrial queue with two types of service and Bernoulli vacation. Int. J. Oper. Res. (in Press)

    Google Scholar 

  4. Artalejo, J.R., Gomez-Corral, A.: Steady state solution of a single server queue with linear repeated request. J. Appl. Probab. 1, 223–233 (1997)

    Article  MathSciNet  Google Scholar 

  5. Choudhury, G., Ke, J.: An unreliable retrial queue with delaying repair and general retrial times under Bernoulli vacation schedule. Appl. Math. Comput. 230, 436–450 (2014)

    MathSciNet  MATH  Google Scholar 

  6. Doshi, B.T.: Queueing systems with vacations-a survey. Queueing Syst. 1, 29–66 (1986)

    Article  MathSciNet  Google Scholar 

  7. Fayolle, G.: A simple telephone exchange with delayed feedback. In: Boxma, O.J., Cohen, J.W., Tijms, H.C. (eds.) Teletraffic Analysis and Computer Performance Evaluation Elsevier Amsterdam, vol. 7, pp. 245–253 (1986)

    Google Scholar 

  8. Kapyrin, V.A.: A study of the stationary distributions of a queueing system with recurring demands. Cybernetics 13, 584–590 (1997)

    Google Scholar 

  9. Ke, J., Wu, C.H., Zhang, Z.G.: Recent developments in vacation queueing models: a short survey. Int. J. Oper. Res. 7, 3–8 (2010)

    Google Scholar 

  10. Ke, J., Chang, F.: Modified vacation policy for M/G/1 retrial queue with balking and feedback. Comput. Ind. Eng. 57, 433–443 (2009)

    Article  Google Scholar 

  11. Keilson, J., Servi, L.D.: Oscillating random walk models for G/G/1 vacation systems with Bernoulli schedules. J. Appl. Probab. 3, 790–802 (1986)

    Article  MathSciNet  Google Scholar 

  12. Krishna Kumar, B., Arivudainambi, D.: The M/G/1 retrial queue with Bernoulli schedules and general retrial times. Comput. Math Appl. 43, 15–30 (2002)

    Article  MathSciNet  Google Scholar 

  13. Krishna Kumar, B., Pavai Madheswari, S., Vijayakumar, A.: The M/G/1 retrial queue with feedback and starting failures. Appl. Math. Model. 26, 1057–1075 (2002)

    Article  Google Scholar 

  14. Rajadurai, P., Saravanarajan, M.C., Chandrasekaran, V.M.: Analysis of repairable M[X]/(G1,G2)/1- feedback retrial G-queue with balking and starting failures under at most J vacations. Appl. Appl. Mathe. 10, 694–717 (2015)

    MATH  Google Scholar 

  15. Sennot, L.I., Humblet, P.A., Tweedie, R.L.: Mean drift and the non ergodicity of Markov chains. Oper. Res. 31, 783–789 (1983)

    Article  MathSciNet  Google Scholar 

  16. Sumitha, D., Udaya Chandrika, K.: Retrial queuing system with starting failure, single vacation and orbital search. Int. J. Comput. Appl. 40, 29–33 (2012)

    Google Scholar 

  17. Takagi, H.: Queueing Analysis. Vacation and Priority Systems, vol. 1, North-Holland Amsterdam (1991)

    Google Scholar 

  18. Yang, T., Templeton, J.G.C.: A survey on retrial queues. Queueing Syst. 2, 201–233 (1987)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to D. Arivudainambi or M. Gowsalya .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Arivudainambi, D., Gowsalya, M. (2018). Cost Analysis of an Unreliable Retrial Queue Subject to Balking, Bernoulli Vacation, Two Types of Service and Starting Failure. In: Ganapathi, G., Subramaniam, A., Graña, M., Balusamy, S., Natarajan, R., Ramanathan, P. (eds) Computational Intelligence, Cyber Security and Computational Models. Models and Techniques for Intelligent Systems and Automation. ICC3 2017. Communications in Computer and Information Science, vol 844. Springer, Singapore. https://doi.org/10.1007/978-981-13-0716-4_16

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-0716-4_16

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-0715-7

  • Online ISBN: 978-981-13-0716-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics