We consider a cyclic polling system with general service times, general switch-over times, and simultaneous batch arrivals. This means that at an arrival epoch, a batch of customers may arrive simultaneously at the different queues of the system. For the exhaustive service discipline, we study the batch sojourn-time, which is defined as the time from an arrival epoch until service completion of the last customer in the batch. We obtain exact expressions for the Laplace–Stieltjes transform of the steady-state batch sojourn-time distribution, which can be used to determine the moments of the batch sojourn-time and, in particular, its mean. However, we also provide an alternative, more efficient way to determine the mean batch sojourn-time, using mean value analysis. We briefly show how our framework can be applied to other service disciplines: locally gated and globally gated. Finally, we compare the batch sojourn-times for different service disciplines in several numerical examples. Our results show that the best performing service discipline, in terms of minimizing the batch sojourn-time, depends on system characteristics.

, ,
doi.org/10.1007/s11134-016-9513-y, hdl.handle.net/1765/95444
ERIM Top-Core Articles
Queueing Systems
Erasmus University Rotterdam

van der Gaast, J., Adan, I., & de Koster, R. (2017). The analysis of batch sojourn-times in polling systems. Queueing Systems, 1–23. doi:10.1007/s11134-016-9513-y