Queuing analysis of polling models
- 1 March 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 20 (1) , 5-28
- https://doi.org/10.1145/62058.62059
Abstract
A polling model is a system of multiple queues accessed by a single server in cyclic order. Polling models provide performance evaluation criteria for a variety of demand-based, multiple-access schemes in computer and communication systems. This paper presents an overview of the state of the art of polling model analysis, as well as an extensive list of references. In particular, single-buffer systems and infinite-buffer systems with exhaustive, gated, and limited service disciplines are treated. There is also some discussion of systems with a noncyclic order of service and systems with priority. Applications to computer networks are illustrated, and future research topics are suggested.Keywords
This publication has 84 references indexed in Scilit:
- Waiting times in discrete-time cyclic-service systemsIEEE Transactions on Communications, 1988
- Polling and greedy servers on a lineQueueing Systems, 1987
- Computation of the Variance of the Waiting Time for Token RingsIEEE Journal on Selected Areas in Communications, 1986
- Approximate Delay Analysis and Results for Asymmetric Token-Passing and Polling NetworksIEEE Journal on Selected Areas in Communications, 1986
- Performance of Integrated Packet Voice/Data Token-Passing RingsIEEE Journal on Selected Areas in Communications, 1986
- Queueing systems with vacations ? A surveyQueueing Systems, 1986
- Performance analysis of token ring local area networksComputer Networks and ISDN Systems, 1985
- Polling in a Loop SystemJournal of the ACM, 1980
- Packet Switching in Radio Channels: Part III--Polling and (Dynamic) Split-Channel Reservation Multiple AccessIEEE Transactions on Communications, 1976
- Waiting Lines and Times in a System with PollingJournal of the ACM, 1974