Queuing systems on a circle

Dirk Kroese, Volker Schmidt

Research output: Contribution to journalArticleAcademicpeer-review

12 Citations (Scopus)
98 Downloads (Pure)


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.
Original languageUndefined
Pages (from-to)303-331
Number of pages29
JournalZeitschrift für Operations Research
Issue number3
Publication statusPublished - 1993


  • METIS-140750
  • IR-92532

Cite this