Affiliation:
1. IBM Research, Tokyo, Japan
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.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Reference210 articles.
1. A Unified Approach to Scan Time Analysis of Token Rings and Polling Networks.
2. Traffic analysis of a token ring PBX. iEEE;APPLETON J. M.;Trans. Comrnun. COM-34,1986
3. A queueing system with relative and cyclic priorities;ARNDT K.;Elektron. Inf. Kybern.,1984
4. Queueing with alternating priorities;AVI-ITZHAK B.;Oper. Res.,1965
Cited by
159 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献