Queueing systems on a circle

Queueing systems on a circle

0.00 Avg rating0 Votes
Article ID: iaor19942003
Country: Germany
Volume: 37
Start Page Number: 303
End Page Number: 331
Publication Date: Dec 1993
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors: ,
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. The authors 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.

Reviews

Required fields are marked *. Your email address will not be published.