Article ID: | iaor20003834 |
Country: | United States |
Volume: | 45 |
Issue: | 4 |
Start Page Number: | 536 |
End Page Number: | 543 |
Publication Date: | Jul 1997 |
Journal: | Operations Research |
Authors: | Boxma O.J., Borst S.C. |
Keywords: | polling systems |
We consider two different single-server cyclic polling models: (i) a model with zero switchover times, and (ii) a model with nonzero switchover times, in which the server keeps cycling when the system is empty. For both models we relate the steady-state queue length distribution at a queue to the queue length distributions at server visit beginning and visit completion instants at that queue; as a by-product we obtain a short proof of the Fuhrmann–Cooper decomposition. For the large class of polling systems that allow a multitype branching process interpretation, we expose a strong relation between the queue length, as well as waiting-time, distributions in the two models. The results enable a very efficient numerical computation of the waiting-time moments under different switchover time scenarios.