Abstract
Consider a ring on which customers arrive according to a Poisson process. Arriving customers drop somewhere on the circle and wait there for a server who travels on the ring. Whenever this server encounters a customer, he stops and serves the customer according to an arbitrary service time distribution. After the service is completed, the server removes the client from the circle and resumes his journey.
We are interested in the number and the locations of customers that are waiting for service. These locations are modeled as random counting measures on the circle. Two different types of servers are considered: The polling server and the Brownian (or drunken) server. It is shown that under both server motions the system is stable if the traffic intensity is less than 1. Furthermore, several earlier results on the configuration of waiting customers are extended, by combining results from random measure theory, stochastic integration and renewal theory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Asmussen S (1987)Applied Probability and Queues. Wiley & Sons, New York
Coflman Jr. EG, Gilbert EN (1986) A Continuous Polling System with Constant Service Times.IEEE Trans. Inf. Th. it-32 (4):584–591
Coffman Jr EG, Gilbert EN (1987) Polling and Greedy Servers on a Line.Queueing Systems 2:115–145
Daley DJ, Vere-Jones D (1988)An Introduction to the Theory of Point Processes. Springer-Verlag, New York
Eisenberg M (1972) Queues with periodic service and change-over times.Oper. Res. 20:440–451
Franken P, König D, Arndt U, Schmidt V (1981)Queues and Point Processes. Akademie-Verlag, Berlin
Fuhrmann S, Cooper RB (1985a) Stochastic Decomposition in theM/G/1 Queue with Generalized Vacations.Oper. Res. 33:1117–1119
Fuhrmann S, Cooper RB (1985b) Application of Decomposition Principle inM/G/1 Vacation Model to Two Continuum Cyclic Queueing Models—Especially Token-Ring LANs.AT&T Technical Journal 64 (5):1091–1098
Gutjahr R (1977) Eine Bemerkung zur Existenz unendlich vieler “Leerpunkte” in Bedienungssystemen mit unendlich vielen Bedienungsgeräten.Math. Operationsforsch. Statist. Ser. Optimization 8:245–251
Kroese DP, Schmidt V (1992) A Continuous Polling System with General Service Times.Ann. of Appl. Probab 2(4):906–927
Liptser RS, Shiryayev AN (1978)Statistics of Random Processes. II: Applications. Springer Verlag, New York
Mack C, Murphy T, Webb NL (1957) The efficiency ofN machines uni-directionally patrolled by one operative when walking time and repair times are constant.J. Roy. Statist. Soc. (B) 19:166–172
Stolyar A, Coffman Jr. EG (1991) Polling on a Line: General Service Times. Preprint
Takagi H (1986)Analysis of Polling Systems. The MIT Press, Cambridge Massachusetts
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kroese, D.P., Schmidt, V. Queueing systems on a circle. ZOR - Methods and Models of Operations Research 37, 303–331 (1993). https://doi.org/10.1007/BF01415999
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01415999