Abstract
In this note we consider two queueing systems: a symmetric polling system with gated service at allN queues and with switchover times, and a single-server single-queue model with one arrival stream of ordinary customers andN additional permanently present customers. It is assumed that the combined arrival process at the queues of the polling system coincides with the arrival process of the ordinary customers in the single-queue model, and that the service time and switchover time distributions of the polling model coincide with the service time distributions of the ordinary and permanent customers, respectively, in the single-queue model. A complete equivalence between both models is accomplished by the following queue insertion of arriving customers. In the single-queue model, an arriving ordinary customer occupies with probabilityp i a position at the end of the queue section behind theith permanent customer,i = l, ...,N. In the cyclic polling model, an arriving customer with probabilityp i joins the end of theith queue to be visited by the server, measured from its present position.
For the single-queue model we prove that, if two queue insertion distributions {p i, i = l, ...,N} and {q i, i = l, ...,N} are stochastically ordered, then also the workload and queue length distributions in the corresponding two single-queue versions are stochastically ordered. This immediately leads to equivalent stochastic orderings in polling models.
Finally, the single-queue model with Poisson arrivals andp 1 = 1 is studied in detail.
Similar content being viewed by others
References
O.M.E. Ali and M.F. Neuts, A service system with two stages of waiting and feedback of customers, J. Appl. Prob. 21 (1984) 404–413.
E. Altman, P. Konstantopoulos and Z. Liu, Stability, monotonicity and invariant quantities in general polling systems, Queueing Syst. 11 (1992) 35–57.
O.J. Boxma, Workloads and waiting times in single-server systems with multiple customer classes, Queueing Syst. 5 (1989) 185–214.
O.J. Boxma and J.W. Cohen, TheM/G/1 queue with permanent customers, IEEE J. Sel. Areas Commun. SAC-9 (1991) 179–184.
O.J. Boxma and J.A. Weststrate, Waiting times in polling systems with Markovian server routing, in:Messung, Modellierung und Bewertung von Rechensystemen und Netzen, eds. G. Stiege and J.S. Lie (Springer, Berlin, 1989) pp. 89–104.
H. Levy, M. Sidi and O.J. Boxma, Dominance relations in polling systems, Queueing Syst. 6 (1990) 155–171.
Z. Liu, Ph. Nain and D.F. Towsley, On optimal polling policies, Queueing Syst. 11 (1992) 59–83.
S.M. Ross,Stochastic Processes (Wiley, New York, 1983).
H. Takagi,Analysis of Polling Systems (MIT Press, Cambridge, MA, 1986).
H. Takagi, Queueing analysis of polling models: an update, in:Stochastic Analysis of Computer and Communication Networks, ed. H. Takagi (North-Holland, Amsterdam, 1990) pp. 267–318.
H. Takagi,Queueing Analysis. Vol. 1: Vacation and Priority Systems, Part 1 (North-Holland, Amsterdam, 1991).
T. Takine and T. Hasegawa, On theM/G/1 queue with multiple vacations and gated service discipline, J. Oper. Res. Soc. Japan (1992), to appear.
Author information
Authors and Affiliations
Additional information
Part of the research of the first author has been supported by the Esprit BRA project QMIPS.
Rights and permissions
About this article
Cite this article
Boxma, O.J., Kelbert, M. Stochastic bounds for a polling system. Ann Oper Res 48, 295–310 (1994). https://doi.org/10.1007/BF02024662
Issue Date:
DOI: https://doi.org/10.1007/BF02024662