The power-series algorithm applied to cyclic polling systems
- 1 January 1991
- journal article
- research article
- Published by Taylor & Francis in Communications in Statistics. Stochastic Models
- Vol. 7 (4) , 527-545
- https://doi.org/10.1080/15326349108807205
Abstract
The computation scheme of the power-series algorithm for the evaluation of the joint queue length distributions for a broad class of multi-queue systems is extended in order to become applicable to polling systems with non-negligible switching times. Because the server continues to move along the queues when no jobs are present, these systems do not possess a unique empty state. This makes that the algorithm is no longer purely recursive, but requires the solution of some sets of linear equations. Performance of the algorithm and properties of the model are discussed on the basis of some examples.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- A numerical approach to cyclic-service queueing modelsQueueing Systems, 1990
- Exact results for the cyclic-service queue with a Bernoulli schedulePerformance Evaluation, 1990
- On a numerical method for calculating state probabilities for queueing systems with more than one waiting lineJournal of Computational and Applied Mathematics, 1987
- Average Delay Approximation of M/G/1 Cyclic Service Queues with Bernoulli SchedulesIEEE Journal on Selected Areas in Communications, 1986
- Analysis of polling systemsPerformance Evaluation, 1985
- Multiqueue Systems with Nonexhaustive Cyclic ServiceBell System Technical Journal, 1979
- On the Convergence and Stability of the Epsilon AlgorithmSIAM Journal on Numerical Analysis, 1966