Dynamic polling orders in multiserver multiqueue systems

Generalised 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 GreatSPN, the software tool for the analysis of GSPNs, and are presented as curves of the average customer delay and waiting time as well as throughput. 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 case is taken into account