Skip to main content
Log in

A single-server discrete-time retrial G-queue with server breakdowns and repairs

  • Published:
Acta Mathematicae Applicatae Sinica, English Series Aims and scope Submit manuscript

Abstract

This paper concerns a discrete-time Geo/Geo/1 retrial queue with both positive and negative customers where the server is subject to breakdowns and repairs due to negative arrivals. The arrival of a negative customer causes one positive customer to be killed if any is present, and simultaneously breaks the server down. The server is sent to repair immediately and after repair it is as good as new. The negative customer also causes the server breakdown if the server is found idle, but has no effect on the system if the server is under repair. We analyze the Markov chain underlying the queueing system and obtain its ergodicity condition. The generating function of the number of customers in the orbit and in the system are also obtained, along with the marginal distributions of the orbit size when the server is idle, busy or down. Finally, we present some numerical examples to illustrate the influence of the parameters on several performance characteristics of the system.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alfa, A.S. Discrete-time analysis of the GI/G/1 system with Bernoulli retrials: An algorithmic approach. Annals of Operations Research, 141: 51–66 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Artalejo, J.R. G-networks: A versatile approach for work removal in queueing networks. European J. Operational Research, 126: 233–249 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Artalejo, J.R., Gómez-Corral, A. Stochastic analysis of the departure and quasi-input processes in a versatile singleserver queue. Journal of Applied Mathematics and Stochastic Analysis, 9: 171–183 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  4. Artalejo, J.R., Gómez-Corral, A. Generalized birth and death processes with applications to queues with repeated attempts and negative arrivals. OR Spektrum, 20: 5–14 (1998)

    Article  MATH  Google Scholar 

  5. Artalejo, J.R., Gómez-Corral, A. Analysis of a stochastic clearing system with repeated attempts. Stochastic Models, 14: 623–645 (1998)

    Article  MATH  Google Scholar 

  6. Artalejo, J.R., Gómez-Corral, A. On a singal server queue with negative arrivals and request repated. Journal of Applied Probability, 36(3): 907–918 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Artalejo, J.R., Gómez-Corral, A. Performance analysis of a single-server queue with repeated attempts. Mathematical and Computer Modelling, 30: 79–88 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Artalejo, J.R., Gómez-Corral, A. Computation of the limiting distribution in queueing systems with repeated attempts and disasters. RAIRO Operations Research, 33: 371–382 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Atencia, I., Moreno, P. The discrete-time Geo/Geo/1 queue with negative customers and disasters. Computers & Operations Research, 31: 1537–1548 (2004)

    Article  MATH  Google Scholar 

  10. Atencia, I., Moreno, P. A discrete-time Geo/G/1 retrial queue with general retrial time. Queueing Systems, 48: 5–21 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  11. Atencia, I., Moreno, P. A single-server G-queue in discrete-time with geometrical arrival and service process. Performance Evaluation, 59: 85–97 (2005)

    Article  Google Scholar 

  12. Atencia, I., Moreno, P. A discrete-time Geo/G/1 retrial queue with the server subject to starting failures. Annals of Operational Research, 141: 85–107 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  13. Cramer, C.E., Gelenbe, E. Video quality and traffic QoS in learning-based sub-sampled and receiverinterpolated video sequences. IEEE J. Selected Areas Commun., 18: 150–167 (2000)

    Article  Google Scholar 

  14. Cramer, C.E., Gelenbe, E., Bakircioglu, H. Low bit-rate video compression with neural networks and temporal subsampling. Proc. IEEE, 84:1529–1543 (1996)

    Article  Google Scholar 

  15. Gelenbe, E. Random neural networks with negative and positive signals and product form solution. Neural Comput., 1: 502–510 (1989)

    Article  Google Scholar 

  16. Gelenbe, E. Learning in the recurrent random neural network. Neural Comput., 5: 154–164 (1993)

    Article  Google Scholar 

  17. Gelenbe, E. G-networks: a unifying model for neural and queueing networks. Ann. Oper. Res., 48: 433–461 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  18. Gelenbe, E. The first decade of G-networks. Eur. J. Oper. Res., 126: 231–232 (2000)

    Article  MATH  Google Scholar 

  19. Gelenbe, E., Cramer, C., Sungur, M., Gelenbe, P. Traffic and video quality in adaptive neural compression. Multimedia Syst., 4: 357–369 (1996)

    Article  Google Scholar 

  20. Gelenbe, E., Feng, Y., Krishnan, K.R.R. Neural network methods for volumetric magnetic resonance imaging of the human brain. Proc. IEEE, 84: 1488–1496 (1996)

    Article  Google Scholar 

  21. Gelenbe, E., Hussain, K.F. Learning in the multiple class random neural network. IEEE Trans. Neural Netw., 13: 1257–1267 (2002)

    Article  Google Scholar 

  22. Gelenbe, E., Kocak, T. Area-based results for mine detection. IEEE Trans. Geosci. Remote Sens., 38: (2000) 12–24

    Article  Google Scholar 

  23. Gelenbe, E., Schassberger, M. Stability of product form G-networks. Prob. Eng. Inform. Sci., 6: 271–276 (1992)

    Article  MATH  Google Scholar 

  24. Gelenbe, E., Seref, E., Xu, Z. Simulation with learning agents. Proc. IEEE, 89: 148–157 (2001)

    Article  Google Scholar 

  25. Gelenbe, E., Shachnai, H. On G-networks and resource allocation in multimedia systems. Eur. J. Oper. Res., 126: 308–318 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  26. Harrison, P.G., Patel, N.M., Pitel, E. Reliability modelling using G-queues. European Journal of Operational Research, 126: 273–287 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  27. Hunter, J.J. Mathematical Techniques of Applied Probability, Vol. 2, Discrete-time Models: Techniques and Applications. Academic Press, New York, 1983

    Google Scholar 

  28. Wang, J., Liu, B., Li, J. Transient analysis of an M/G/1 retrial queue subject to disasters and server failures. European Journal of Operational Research, 189(3): 1118–1132 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  29. Wang, J., Zhao, Q. Discrete-time Geo/G/1 retrial queue with general retrial times and starting failures. Mathematical and Computer Modelling, 45(7–8): 853–863 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  30. Wang, J., Zhao, Q. A discrete-time Geo/G/1 retrial queue with starting failures and second optional service. Computers and Mathematics with Applications, 53(1): 115–127 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  31. Yang, T., Li, H. On the steady-state queue size distribution of the discrete-time Geo/G/1 queue with repeated customers. Queueing systems, 21: 199–215 (1995)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jin-ting Wang.

Additional information

Supported by the National Natural Science Foundation of China (No. 10871020).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Jt., Zhang, P. A single-server discrete-time retrial G-queue with server breakdowns and repairs. Acta Math. Appl. Sin. Engl. Ser. 25, 675–684 (2009). https://doi.org/10.1007/s10255-008-8823-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-008-8823-1

Keywords

2000 MR Subject Classification

Navigation