Approximate anlysis of an unreliable M/M/c retrial queue with phase merging algorithm
| Autor: | EL HADDAD, Meriem, BELARBİ, Faiza |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2015 |
| Předmět: | |
| Zdroj: | Volume: 4, Issue: 3 9-21 New Trends in Mathematical Sciences |
| ISSN: | 2147-5520 |
| Popis: | In this paper, we investigate an approximate analysisof unreliable retrial queue with in which all servers are subject tobreakdowns and repairs. Arriving customers that are unable to access a serverdue to congestion or failure can choose to enter a retrial orbit for anexponentially distributed amount of time and persistently attempt to gainaccess to a server, or abandon their request and depart the system. Once acustomer is admitted to a service station, he remains there for a randomduration until service is complete and then depart the system. However, if theserver fails during service, i.e., an active breakdown, the customer may chooseto abandon the system or proceed directly to the retrial orbit while the serverbegins repair immediately. In the unreliable model, there are no exactsolutions when the number of servers exceeds one. Therefore, we seek toapproximate the steady-state joint distribution of the number of customers inorbit and the status of the servers for the case of Markovianarrival and service times. Our approach to deriving the approximatesteady-state probabilities employs a phase-merging algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|