A continuous polling system with general service times (Q1203750)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A continuous polling system with general service times |
scientific article |
Statements
A continuous polling system with general service times (English)
0 references
22 February 1993
0 references
When not busy, a single server moves at constant speed in the same direction on a circle. Customers arrive according to a constant-rate Poisson process and drop independently and uniformly on to the circle. The server stops to serve a customer whenever he encounters one. Service times are i.i.d. random variables with general distribution. When a service has been completed the server continues his journey and the customer departs. For every \(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 as random counting measures. These measures are shown to converge in distribution as \(t\to\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.
0 references
cyclic serving system
0 references
random counting measure
0 references
Laplace functionals
0 references
limiting random measures
0 references