Journals / New Trends in Mathematical Sciences / 2016 / Cilt: 4 Sayı: 3

Approximate anlysis of an unreliable M/M/c retrial queue with phase merging algorithm

Pages
9–21
Publication Date
2016-09-30
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Our approach to deriving the approximate steady-state probabilities employs a phase-merging algorithm.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this paper, we investigate an approximate analysis of unreliable retrial queue with in which all servers are subject to breakdowns and repairs.
📊
Key Findings & Data:Arriving customers that are unable to access a server due to congestion or failure can choose to enter a retrial orbit for an exponentially distributed amount of time and persistently attempt to gain access to a server, or abandon their request and depart the system.
💡
Conclusion & Impact:Our approach to deriving the approximate steady-state probabilities employs a phase-merging algorithm.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Retrial queue · Multi server · Breakdown and repair of service

Abstract

In this paper, we investigate an approximate analysis of unreliable retrial queue with in which all servers are subject to breakdowns and repairs. Arriving customers that are unable to access a server due to congestion or failure can choose to enter a retrial orbit for an exponentially distributed amount of time and persistently attempt to gain access to a server, or abandon their request and depart the system. Once a customer is admitted to a service station, he remains there for a random duration until service is complete and then depart the system. However, if the server fails during service, i.e., an active breakdown, the customer may choose to abandon the system or proceed directly to the retrial orbit while the server begins repair immediately. In the unreliable model, there are no exact solutions when the number of servers exceeds one. Therefore, we seek to approximate the steady-state joint distribution of the number of customers in orbit and the status of the servers for the case of Markovian arrival and service times. Our approach to deriving the approximate steady-state probabilities employs a phase-merging algorithm.

🔖

Cite This Article

HADDAD, M. E., BELARBİ, F. (2016). Approximate anlysis of an unreliable M/M/c retrial queue with phase merging algorithm. New Trends in Mathematical Sciences, Cilt: 4 Sayı: 3, 9–21. https://ajindex.com/articles/1003802

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (13)

  1. Aissani, A and J.R. Artalejo,, On the single server retrial queue subject to breakdown, Queueing Sys., 30 (1998), 309-321.
  2. Artalejo, J.R. and A. Gomez-Corral, Retrial Queueing Systems: A Computational Approach, Springer, Spain, pp: 318. (2008)
  3. Artalejo, J.R., A classified bibliography of research on retrial queues: Progress in 1990-1999., Busin. Econ., 7 (1999), 187-211.
  4. Artalejo, J.R., Accessible bibliography on retrial queues, Math. Comp. Mod., 30 (1999), 1-6.
  5. Artalejo, J.R., Accessible bibliography on retrial queues: Progress in 2000-2009., Math. Comp. Mod., 51 (2010), 1071-1081.
  6. Brian, P. Crawford, Approximate analysis of an unreliable M/M/2 retrial queue, thesis, (2012)
  7. Courtoi, P.J., Decomposability, instabilities, and saturation in multiprogramming systems, Communications of the ACM, 18 (7) (1975), 371-377.
  8. Falin, G.,, A survey of retrial queues, Queueing Sys., 7, (1990), 127-167.
  9. Falin, G.I. and J.G.C. Templeton, Retrial queues, Champman and Hall, London, pp: 328. (1997)
  10. Korolyuk, V.S. and V.V. Korolyuk, Stochastic models of systems. Kluwer Academic Publishers,
  11. Boston (1999).
  12. Kulkarni, V.G. and B.D. Choi, Retrial queues with server subject to breakdown and repairs, Queueing Sys., 7 (1990), 191-208.
  13. Subramanian, M.G., G. Ayyappan and G. Sekar, M/M/c Retrial queueing system with breakdown and repair of services, Asian Journal of Mthematics and Statistics 4 (4) (2011), 214-223.