Multiserver Markovian Queueing System with Vacation
Autor: | M. I. Afthab Begum, R. Nadarajan |
---|---|
Rok vydání: | 1997 |
Předmět: |
Kendall's notation
Queueing theory Control and Optimization business.industry Applied Mathematics Real-time computing Markov process Management Science and Operations Research M/M/∞ queue Idle symbols.namesake Mean value analysis Server Layered queueing network symbols business Computer network Mathematics |
Zdroj: | Optimization. 41:71-87 |
ISSN: | 1029-4945 0233-1934 |
DOI: | 10.1080/02331939708844326 |
Popis: | An M|M|s queueing model with repeated vacation is studied under the following condition. The system should have at least r servers always available (busy or idle) for service and only the remaining (s — r) servers are allowed to go for vacation, when they are free. The distribution of the number of busy servers and the mean number of units in the system are derived. The steady state system probabilities and the waiting time distribution of an arriving customer are obtained for a particular case |
Databáze: | OpenAIRE |
Externí odkaz: |