Polling on a graph with general arrival and service time distribution
Résumé
We consider a polling system on a graph with general independent arrival, service and walking times. We present necessary and sufficient conditions for stability, based on drift analysis of both the workload and the residual interarrival times within some embedded times called cycles.