M/g/1 Polling Systems with Random Visit Times


We consider a polling system where a group of an infinite number of servers visits sequentially a set of queues. When visited, each queue is attended for a random time. Arrivals at each queue follow a Poisson process, and the service time of each individual customer is drawn from a general probability distribution function. Thus, each of the queues… (More)


4 Figures and Tables

Cite this paper

@inproceedings{Vlasiou2007Mg1PS, title={M/g/1 Polling Systems with Random Visit Times}, author={Manolis Vlasiou}, year={2007} }