Article contents
Transient analysis of M/M/1 queues in discrete time by general server vacations
Published online by Cambridge University Press: 14 July 2016
Abstract
In this contribution we consider an M/M/1 queueing model with general server vacations. Transient and steady state analysis are carried out in discrete time by combinatorial methods. Using weak convergence of discrete-parameter Markov chains we also obtain formulas for the corresponding continuous-time queueing model. As a special case we discuss briefly a queueing system with a T-policy operating.
MSC classification
- Type
- Part 3 Queueing Theory
- Information
- Copyright
- Copyright © Applied Probability Trust 1994
References
- 6
- Cited by