Good and bad dynamic polling orders in symmetric single buffer Markovian multiserver multiqueue systems

Generalized stochastic Petri nets (GSPNs) are used to study the performances of several dynamic polling orders in symmetric multiserver multiqueue systems with one-buffer queues and Markovian interarrival, service, and walk times. Exact numerical results are obtained by means of Great-SPN, a software tool for the analysis of GSPNs, and are presented as curves of the average customer delay and waiting time. The results quantify the performance differences among the various polling orders, and show that the usual cyclic order can be the most effective, if the possibility of shorter walk times in the cyclic cases is adequately taken into account.<>