The Annals of Applied Probability
- Ann. Appl. Probab.
- Volume 2, Number 4 (1992), 906-927.
A Continuous Polling System with General Service Times
Consider a ring on which a server travels at constant speed. Customers arrive on the ring according to a Poisson process, at locations independently and uniformly distributed over the circle. Whenever the server encounters a customer, he stops and serves the client according to a general service time distribution. After the service is completed, the server removes the customer from the ring and resumes his round. The model is analyzed by means of point processes and regenerative processes in combination with some stochastic integration theory. This approach clarifies the analysis of the continuous polling model and provides the means for further generalizations. For every time $t$, the locations of customers that are waiting for service and the positions of clients that have been served during the last tour of the server are represented by random counting measures. These measures converge in distribution as $t \rightarrow \infty$. A recursive expression for the Laplace functionals of the limiting random measures is found, from which the corresponding $k$th moment measures can be derived.
Ann. Appl. Probab., Volume 2, Number 4 (1992), 906-927.
First available in Project Euclid: 19 April 2007
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Cyclic server system cluster representation random counting measures limit distributions Laplace functionals moment formulas stochastic decomposition stochastic integration regnerative processes
Kroese, Dirk P.; Schmidt, Volker. A Continuous Polling System with General Service Times. Ann. Appl. Probab. 2 (1992), no. 4, 906--927. doi:10.1214/aoap/1177005580. https://projecteuclid.org/euclid.aoap/1177005580