Analysis of Polling SystemsA 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. Contents: 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.Hideaki Takagi is with IBM Japan Science Institute in Tokyo. "Analysis of Polling Systems" is included in the Computer Systems Series, Research Reports and Notes, edited by Herb Schwetman. |
Contents
ExhaustiveService DiscreteTime Systems | 36 |
ExhaustiveService ContinuousTime Systems | 70 |
8 | 93 |
Copyright | |
10 other sections not shown
Common terms and phrases
arbitrary arrival process arrivals at station busy period Computer Communications continuous-time systems Cyclic Order define denote derive discrete-time system distribution function E[W₁ equations exhaustive service system Expressnet F₁ F₁(z fi+1 gambler's ruin gated service system given h₁ identical stations IEEE intervisit joint GF Laplace transform limited service system Local Area Networks Loop mean cycle mean message waiting mean number mean waiting message arrivals messages at station messages served MSAP Multiqueue N[Ab Networks Note number of arrivals number of messages number of packets P₁ P₁(z packets arriving parameters polling cycle polling instant polling message polling systems propagation delay Queueing Models Queueing Theory server slot station i+1 super cycle supermessage switch point T₂ tagged message th visit token bus Token Ring transmission UBS-RR Var[L zero reply intervals Σ Σ