A typical polling system consists of a number of queues, attended by a single server in a
fixed order. The present study derives closed-form approximations for the mean waiting times and mean marginal queue lengths of polling systems with renewal arrival processes, which can be computed by simple calculations. The results of the present research may be very suitable for the design and optimisation phase in many application areas, such as telecommunication, maintenance, manufacturing and transportation.
|Place of Publication
|Number of pages
|Published - 2009