M/M/1 queues with working vacations (M/M/1/WV)
| Autor: | S. G. Finn, L. D. Servi |
|---|---|
| Rok vydání: | 2002 |
| Předmět: |
Discrete mathematics
Computer Networks and Communications Computer science M/G/k queue Real-time computing M/D/1 queue M/M/1 queue Fork–join queue M/M/∞ queue Hardware and Architecture Modeling and Simulation Burke's theorem Computer Science::Networking and Internet Architecture M/G/1 queue M/M/c queue Software |
| Zdroj: | Performance Evaluation. 50:41-52 |
| ISSN: | 0166-5316 |
| DOI: | 10.1016/s0166-5316(02)00057-3 |
| Popis: | The classical single server vacation model is generalized to consider a server which works at a different rate rather than completely stops during the vacation period. Simple explicit formulae for the mean, variance, and distribution of the number and time in the system are presented. The distributional results generalize the classical vacation decomposition with no service during a vacation. This model approximates a multi-queue system whose service rate is one of the two speeds for which the fast speed mode cyclically moves from queue to queue with an exhaustive schedule. This work is motivated and illustrated by the analysis of a WDM optical access network using multiple wavelengths which can be reconfigured. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect