This monograph analyzes polling systems to evaluate such basic performance measures as the average queue length and waiting time.
A polling system is one that contains a number of queues served in cyclic order. It is employed in computer-terminal communication systems and implemented in such standard data link protocols as BSC, SDLC, and HDLC, and its analysis is now finding a new application in local-area computer networks. This monograph analyzes polling systems to evaluate such basic performance measures as the average queue length and waiting time. Following a taxonomy of models with reference to previous work, it considers one-message buffer systems and infinite buffer systems with exhaustive, gated, and limited service disciplines. Examples to which the analysis of polling systems is applied are drawn from the field of computer communication networks.
Introduction • One-Message Buffer Systems • Exhaustive Service, Discrete-Time Systems • Exhaustive Service, Continuous-Time Systems • Gated Service Systems • Limited Service Systems • Systems with Zero Reply Intervals • Sample Applications • Future Research Topics • Summary of Important Results
Analysis of Polling Systems is included in the Computer Systems Series, Research Reports and Notes, edited by Herb Schwetman.