We consider a polling system with a finite number of stations fed by
compound Poisson arrival streams of customers asking for service. A server
travels through the system and upon arrival at a station the server serves all
waiting customers until the queue is empty, where the service time distribution
depends on the station. The choice of the station to be visited next as well as
the corresponding walking time may depend on the whole current state. Examples
are systems with a greedy-type routing mechanism. Under appropriate
independence assumptions it is proved that the system is stable if and only if
the workload is less than 1.
Publié le : 1996-02-14
Classification:
Polling system,
stability,
ergodicity of Markov chains,
greedy server,
60K25,
60J27
@article{1034968068,
author = {Foss, Serguei and Last, G\"unter},
title = {Stability of polling systems with exhaustive service policies and
state-dependent routing},
journal = {Ann. Appl. Probab.},
volume = {6},
number = {1},
year = {1996},
pages = { 116-137},
language = {en},
url = {http://dml.mathdoc.fr/item/1034968068}
}
Foss, Serguei; Last, Günter. Stability of polling systems with exhaustive service policies and
state-dependent routing. Ann. Appl. Probab., Tome 6 (1996) no. 1, pp. 116-137. http://gdmltest.u-ga.fr/item/1034968068/