Pollaczek–Khinchin formula for the M/G/1 queue in discrete time with vacations
Authors:
- 1 January 1997
- journal article
- Published by Institution of Engineering and Technology (IET) in IEE Proceedings - Computers and Digital Techniques
- Vol. 144 (4) , 222-226
Abstract
The continuous-time M/G/1 queue with vacations has been studied by many researchers. In the paper the authors report on an investigation of the discrete-time M/G/1 queue using Little's formula and conditional expectation. This direct approach can also be adopted to study the continuous-time case.Keywords
This publication has 7 references indexed in Scilit:
- Discrete-Time Models for Communication Systems Including ATM1993
- Stochastic Decompositions in the M/G/1 Queue with Generalized VacationsOperations Research, 1985
- Technical Note—A Note on the M/G/1 Queue with Server VacationsOperations Research, 1984
- On the M/G/1 Queue with Rest Periods and Certain Service-Independent Queueing DisciplinesOperations Research, 1983
- The T-Policy for the M/G/1 QueueManagement Science, 1977
- Utilization of Idle Time in an M/G/1 Queueing SystemManagement Science, 1975
- Queues Served in Cyclic Order: Waiting TimesBell System Technical Journal, 1970