Pseudo-conservation laws in cyclic-service systems
- 1 December 1987
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 24 (4) , 949-964
- https://doi.org/10.2307/3214218
Abstract
This paper considers single-server, multi-queue systems with cyclic service. Non-zero switch-over times of the server between consecutive queues are assumed. A stochastic decomposition for the amount of work in such systems is obtained. This decomposition allows a short derivation of a ‘pseudo-conservation law' for a weighted sum of the mean waiting times at the various queues. Thus several recently proved conservation laws are generalised and explained.Keywords
This publication has 8 references indexed in Scilit:
- Waiting-time approximations for cyclic-service systems with switch-over timesACM SIGMETRICS Performance Evaluation Review, 1986
- Symmetric queues served in cyclic orderOperations Research Letters, 1985
- Stochastic Decompositions in the M/G/1 Queue with Generalized VacationsOperations Research, 1985
- Exact Results for Nonsymmetric Token Ring SystemsIEEE Transactions on Communications, 1985
- On the M/G/1 queue by additional inputsJournal of Applied Probability, 1984
- Mean-delay approximation for cyclic-service queueing systemsPerformance Evaluation, 1983
- Poisson Arrivals See Time AveragesOperations Research, 1982
- Letter to the Editor—An Alternative Proof of a Conservation Law for the Queue G/G/1Operations Research, 1970