Iterative approximation of \(k\)-limited polling systems (Q885544): Difference between revisions

The paper considers a polling model with a \(k\)-limited service strategy. Under this strategy the server continues working at a queue until either a predefined number of \(k\) customers is served or until the queue becomes empty, whichever happens first. The paper aims to study the marginal queue length distribution under the assumption of general arrival, service and setup distributions. Its goal is the development of a computationally efficient iterative approximation method. The algorithm developed in the paper only needs information on the first two moments of all distributions.