Research Article

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

Volume: 4 Number: 3 September 30, 2016
  • Meriem El Haddad *
  • Faiza Belarbi
EN

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

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.


Keywords

References

  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.

Details

Primary Language

English

Subjects

-

Journal Section

Research Article

Authors

Meriem El Haddad * This is me
Algeria

Faiza Belarbi This is me
Algeria

Publication Date

September 30, 2016

Submission Date

November 22, 2015

Acceptance Date

March 28, 2016

Published in Issue

Year 2016 Volume: 4 Number: 3

APA
El Haddad, M., & Belarbi, F. (2016). Approximate anlysis of an unreliable M/M/c retrial queue with phase merging algorithm. New Trends in Mathematical Sciences, 4(3), 9-21. https://izlik.org/JA36SN73GP
AMA
1.El Haddad M, Belarbi F. Approximate anlysis of an unreliable M/M/c retrial queue with phase merging algorithm. New Trends in Mathematical Sciences. 2016;4(3):9-21. https://izlik.org/JA36SN73GP
Chicago
El Haddad, Meriem, and Faiza Belarbi. 2016. “Approximate Anlysis of an Unreliable M M C Retrial Queue With Phase Merging Algorithm”. New Trends in Mathematical Sciences 4 (3): 9-21. https://izlik.org/JA36SN73GP.
EndNote
El Haddad M, Belarbi F (September 1, 2016) Approximate anlysis of an unreliable M/M/c retrial queue with phase merging algorithm. New Trends in Mathematical Sciences 4 3 9–21.
IEEE
[1]M. El Haddad and F. Belarbi, “Approximate anlysis of an unreliable M/M/c retrial queue with phase merging algorithm”, New Trends in Mathematical Sciences, vol. 4, no. 3, pp. 9–21, Sept. 2016, [Online]. Available: https://izlik.org/JA36SN73GP
ISNAD
El Haddad, Meriem - Belarbi, Faiza. “Approximate Anlysis of an Unreliable M M C Retrial Queue With Phase Merging Algorithm”. New Trends in Mathematical Sciences 4/3 (September 1, 2016): 9-21. https://izlik.org/JA36SN73GP.
JAMA
1.El Haddad M, Belarbi F. Approximate anlysis of an unreliable M/M/c retrial queue with phase merging algorithm. New Trends in Mathematical Sciences. 2016;4:9–21.
MLA
El Haddad, Meriem, and Faiza Belarbi. “Approximate Anlysis of an Unreliable M M C Retrial Queue With Phase Merging Algorithm”. New Trends in Mathematical Sciences, vol. 4, no. 3, Sept. 2016, pp. 9-21, https://izlik.org/JA36SN73GP.
Vancouver
1.Meriem El Haddad, Faiza Belarbi. Approximate anlysis of an unreliable M/M/c retrial queue with phase merging algorithm. New Trends in Mathematical Sciences [Internet]. 2016 Sep. 1;4(3):9-21. Available from: https://izlik.org/JA36SN73GP