Analysis of finite-capacity polling systems
- 1 June 1991
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 23 (2), 373-387
- https://doi.org/10.2307/1427754
Abstract
We consider a system of N finite-capacity queues attended by a single server in cyclic order. For each visit by the server to a queue, the service is given continuously until that queue becomes empty (exhaustive service), given continuously only to those customers present at the visiting instant (gated service), or given to only a single customer (limited service). The server then switches to the next queue with a random switchover time, and administers the same type of service there similarly. For such a system where each queue has a Poisson arrival process, general service time distribution, and finite capacity, we find the distribution of the waiting time at each queue by utilizing the known results for a single M/G/1/K queue with multiple vacations.Keywords
This publication has 10 references indexed in Scilit:
- Stochastic Petri net models of polling systemsIEEE Journal on Selected Areas in Communications, 1990
- M/G/1/N Queue with vacation time and limited service disciplinePerformance Evaluation, 1989
- Performance analysis of finite capacity polling systems with nonexhaustive servicePerformance Evaluation, 1988
- Exact analysis of asymmetric polling systems with single buffersIEEE Transactions on Communications, 1988
- Queueing analysis of finite buffer token networksACM SIGMETRICS Performance Evaluation Review, 1988
- Queuing analysis of polling modelsACM Computing Surveys, 1988
- Queueing systems with vacations ? A surveyQueueing Systems, 1986
- M/G/1/N Queue with Vacation Time and Exhaustive Service DisciplineOperations Research, 1984
- The M/G/1 Finite Capacity Queue with DelaysIEEE Transactions on Communications, 1980
- An Analysis of a Loop Switching System with Multirank Buffers Based on the Markov ProcessIEEE Transactions on Communications, 1974