Abstract
We study the waiting-time distributions in cyclic polling models with renewal arrivals, general service and switch-over times, and exhaustive service at each of the queues. The assumption of renewal arrivals prohibits an exact analysis and reduces the available analytic results to heavy-traffic asymptotics, limiting results for large switch-over times and large numbers of queues, and some numerical algorithms. Motivated by this, the goal of this paper is to propose a new method for deriving simple closed-form approximations for the complete waiting-time distributions that work well for arbitrary load values. Extensive simulation results show that the approximations are highly accurate over a wide range of parameter settings. Copyright © Taylor & Francis Group, LLC.
Original language | English |
---|---|
Pages (from-to) | 318-332 |
Journal | Stochastic Models |
Volume | 27 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2012 |