Skip to main content
SpringerLink
Log in

A retrial queue with redundancy and unreliable server

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

Retrial queues are useful in the stochastic modelling of computer and telecommunication systems amongst others. In this paper we study a version of the retrial queue with variable service. Such a point of view gives another look at the unreliable retrial queueing problem which includes the redundancy model.

By using the theory of piecewise Markovian processes, we obtain the analogue of the Pollaczek-Khintchine formula for such retrial queues, which is useful for operations researchers to obtain performance measures of interest.

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

Access this article

Log in via an institution

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. A. Aissani, Unreliable queueing with repeated orders, Microelectron. Reliab. 33 (1993) 2093–2106.

    Google Scholar 

  2. A. Aissani,Stochastic Models of Reliability Theory (Office des Publications Universitaires, Algiers, 1992), in French.

    Google Scholar 

  3. A. Aissani, Heavy loading approximation of the unreliable queue with repeated orders, in:Colloque “Méthodes et outils d'aide á la décision”, Bejaia (1992) pp. 97–102.

  4. A. Aissani, Influence de la fiabilité des serveurs sur la distribution du nombre de clients en “Orbite” dans un systémeM/G/1/0 avec rappels, Technologies Avancées 2 (1991) 23–28.

    Google Scholar 

  5. A. Aissani, Queueing systems with a single unreliable server, Paper 756 Be-D83, Bielorussian Institute for Scientific and Technical Information, Minsk (1983).

    Google Scholar 

  6. A.M. Alexandrov, A queueing system with repeated orders, Izv. Akad. Nauk SSSR, Tekhn. Kibern. 2 (1974) 86–89.

    Google Scholar 

  7. R. Barlow and F. Proshan,Mathematical Theory of Reliability (Wiley, New York, 1965).

    Google Scholar 

  8. F. Beichelt and. P. Franken,Reliability and Maintenance. Mathematical Methods (Nauka, Moscow, 1988), in Russian (German edition: Verlag Technik, Berlin, 1983).

    Google Scholar 

  9. B.S. Dhillon and S.M. Rayapati, Human error modelling of parallel and standby redundant systems, Int. J. Syst. Sci. 19 (1988) 589–611.

    Google Scholar 

  10. M.V. Burlakov, Situational control in non-Markov queueing systems, Auto. Remote Contr. 50 (1989) 637–646.

    Google Scholar 

  11. Q.H. Choo and B.W. Conolly, New results in the theory of repeated orders queueing systems, J. Appl. Prob. 16 (1979) 631–639.

    Google Scholar 

  12. J.W. Cohen, Basic problems of telephone traffic theory and the influence of repeated calls, Philips Telecomm. Rev. 18 (1957) 49–100.

    Google Scholar 

  13. G.I. Falin, Multiphase servicing in a single-channel system for automation of experiments with repeated calls, in:Problems of Automation of Scientific Investigation in Radio Engineering and Electronics (USSR Academy of Science, Moscow, 1975).

    Google Scholar 

  14. G.I. Falin, Aggregate arrival of customers in one-line system with repeated calls, Ukrainian Math. J. 28 (1976) 437–440.

    Google Scholar 

  15. G.I. Falin, A. single-line system with repeated orders, Izv. Akad. Nauk SSSR, Tekhn. Kibern. 2 (1980) 76–83.

    Google Scholar 

  16. G.I. Falin, A survey of retrial queues, Queueing Syst. 7 (1990) 127–168.

    Google Scholar 

  17. M.S. Finkelstein,Reliability of Systems with Imperfect Repair (Znanie, Moscow, 1991), in Russian.

    Google Scholar 

  18. M. Finkelstein, Some notes on wear-dependent systems, Microelectron. Reliab. 33 (1993) 115–117.

    Google Scholar 

  19. P. Franken, B. Kirstein and A. Sreller, Reliability analysis of complex systems with repair, Elektron. Informationsverarb. Kybernet. 20 (1984) 407–422.

    Google Scholar 

  20. B.V. Gnedenko and I.N. Kovalenko,Introduction to Queueing Theory (Israel Program for Scientific Translations, 1969).

  21. B. Gnedenko and M. Schneps-Schneppe, Statistical problems in teletraffic theory,7th Int. Teletraffic Congr., Stockholm (1973).

  22. B.V. Gnedenko, Y.K. Beliaev and A.D. Soloviev,Mathematical Methods of Reliability (Wiley, 1969).

  23. L.R. Goel, R.K. Agnihotri and R. Gupta, Stochastic analysis of a two-unit warm standby system with fault detection and inspection, Microelectron. Reliab. 30 (1990) 61–64.

    Google Scholar 

  24. B.S. Greenberg,M/G/1 queueing systems with returning customers, J. Appl. Prob. 26 (1989) 152–163.

    Google Scholar 

  25. C. Co Henry and A. Araar, Maintenance ofM/G/1 production system, Int. J. Prod. Res. 29 (1991) 2135–2149.

    Google Scholar 

  26. L.E. Hsu and C.S. Tapiero, Maintenance of an unreliableM/G/1 queue-like job shop, Queueing Syst. 2 (1987).

  27. J. Keilson, J. Cozzolino and H. Young, A service system with unfilled requests repeated, Oper. Res. 16(1968) 1126–1137.

    Google Scholar 

  28. F.P. Kelly, Auto-repeat facilities and telephone network performance, J. Roy. Statist. Soc. B 48 (1985) 123–132.

    Google Scholar 

  29. L. Kosten, On the influence of repeated calls in the theory of probabilities of blocking, De Ingenieur 59 (1947), in Dutch.

  30. A. Kumar and M. Agarwal, A review of standby redundant systems, IEEE Trans. Reliab. R-20 (1980) 290–294.

    Google Scholar 

  31. A. Lesanovsky, Stochastic ordering in a two-unit redundant system with three states of units, Math. Operationsforsch. Statist. Optim. 15 (1984) 623–636.

    Google Scholar 

  32. K.C. Madan, A single channel queue with bulk service subject to interruption, Microelectron. Reliab. 29 (1989) 813–818.

    Google Scholar 

  33. I.S. Mikadze and R.V. Kakubav, A redundant queueing system with delay, Kibernetika (Kiev) 4 (1984) 97–101.

    Google Scholar 

  34. I.S. Mikadze, A periodically controllable service system with an unreliable device, Cybernetics 24 (1988) 68–75.

    Google Scholar 

  35. G.S. Mokaddis and Kh.M. El-Said, Two models for two-unit warm standby redundant system with two different kinds of repair and tolerable time, Microelectron. Reliab. 30 (1990) 327–374.

    Google Scholar 

  36. K. Murari and V. Goyal, Cost analysis of a two-unit warm standby reliability system with two-types of repair facilities, Microelectron. Reliab. 25 (1985) 681–689.

    Google Scholar 

  37. T.E. Phipps Jr, Machine repair as a priority waiting line problem, Oper. Res. 76 (1966).

  38. S.K. Srinivasan and R. Subramanian,Probabilistic Analysis of Redundant Systems, Lecture Notes in Economic and Mathematical Systems (Springer, Berlin/Heidelberg/New York, 1980).

    Google Scholar 

  39. S.H. Srinivasan, A standby redundant model with non-instantaneous switchover, IEEE Trans. Reliab. R-17 (1968) 175–178.

    Google Scholar 

  40. R. Subramanian and R. Natarasar, A two-unit system with imperfect repair, Math. Oper. Statist., Ser. Optimization 11 (1980) 617–622.

    Google Scholar 

  41. J.G.C. Templeton, Editorial introduction, Queueing Syst. 7 (1990) 125–126.

    Google Scholar 

  42. S.G. Tochenaya, Priority queue with unreliable server and redundant unit, in:Teletraffic theory and Information Networks (Nauka, Moscow, 1977), in Russian.

    Google Scholar 

  43. S.G. Tochenaya, Virtual waiting time in a queueing system with unreliable server and redundant unit, in:Teletraffic Theory and Networks with Controllable Elements (Nauka, Moscow, 1980), in Russian.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut de Mathématiques, Université de Blida, BP 270, 09000, Blida, Algeria

    A. Aissani

Authors
  1. A. Aissani
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aissani, A. A retrial queue with redundancy and unreliable server. Queueing Syst 17, 431–449 (1994). https://doi.org/10.1007/BF01158703

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01158703

Keywords

Search

Navigation