Abstract
In this paper we consider a single-server polling system with switch-over times. We introduce a new service discipline, mixed gated/exhaustive service, that can be used for queues with two types of customers: high and low priority customers. At the beginning of a visit of the server to such a queue, a gate is set behind all customers. High priority customers receive priority in the sense that they are always served before any low priority customers. But high priority customers have a second advantage over low priority customers. Low priority customers are served according to the gated service discipline, i.e. only customers standing in front of the gate are served during this visit. In contrast, high priority customers arriving during the visit period of the queue are allowed to pass the gate and all low priority customers before the gate.
We study the cycle time distribution, the waiting time distributions for each customer type, the joint queue length distribution of all priority classes at all queues at polling epochs, and the steady-state marginal queue length distributions for each customer type. Through numerical examples we illustrate that the mixed gated/exhaustive service discipline can significantly decrease waiting times of high priority jobs. In many cases there is a minimal negative impact on the waiting times of low priority customers but, remarkably, it turns out that in polling systems with larger switch-over times there can be even a positive impact on the waiting times of low priority customers.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Boon, M.A.A., Adan, I.J.B.F., Boxma, O.J.: A two-queue polling model with two priority levels in the first queue. In: ValueTools 2008 (Third International Conference on Performance Evaluation Methodologies and Tools, Athens, Greece, October 20–24, 2008)
Boon, M.A.A., Adan, I.J.B.F., Boxma, O.J.: A polling model with multiple priority levels. Eurandom report 2008-029, Eurandom (2008)
Borst, S.C.: Polling systems. CWI Tracts, vol. 115 (1996)
Boxma, O.J.: Polling systems. In: From universal morphisms to megabytes: A Baayen space odyssey. Liber amicorum for P.C. Baayen, pp. 215–230. CWI, Amsterdam (1994)
Boxma, O.J., Groenendijk, W.P.: Pseudo-conservation laws in cyclic-service systems. J. Appl. Probab. 24(4), 949–964 (1987)
Boxma, O.J., Weststrate, J.A.: Waiting times in polling systems with Markovian server routing. In: Stiege, G., Lie, J.S. (eds.) Messung, Modellierung und Bewertung von Rechensystemen und Netzen, pp. 89–105. Springer, Berlin (1989)
Cohen, J.W.: The Single Server Queue. North-Holland, Amsterdam (1982). Revised edition
Fiems, D., De Vuyst, S., Bruneel, H.: The combined gated-exhaustive vacation system in discrete time. Perform. Eval. 49, 227–239 (2002)
Fournier, L., Rosberg, Z.: Expected waiting times in polling systems under priority disciplines. Queueing Syst. 9(4), 419–439 (1991)
Fuhrmann, S.W.: Performance analysis of a class of cyclic schedules. Technical memorandum 81-59531-1, Bell Laboratories, March 1981
Fuhrmann, S.W., Cooper, R.B.: Stochastic decompositions in the M/G/1 queue with generalized vacations. Oper. Res. 33(5), 1117–1129 (1985)
Gianini, J., Manfield, D.R.: An analysis of symmetric polling systems with two priority classes. Perform. Eval. 8, 93–115 (1988)
Keilson, J., Servi, L.D.: The distributional form of Little’s Law and the Fuhrmann–Cooper decomposition. Oper. Res. Lett. 9(4), 239–247 (1990)
Kella, O., Yechiali, U.: Priorities in M/G/1 queue with server vacations. Nav. Res. Logist. 35, 23–34 (1988)
Khamisy, A., Altman, E., Sidi, M.: Polling systems with synchronization constraints. Ann. Oper. Res. 35, 231–267 (1992)
Resing, J.A.C.: Polling systems and multitype branching processes. Queueing Syst. 13, 409–426 (1993)
Sharafali, M., Co, H.C., Goh, M.: Production scheduling in a flexible manufacturing system under random demand. Eur. J. Oper. Res. 158, 89–102 (2004)
Shimogawa, S., Takahashi, Y.: A pseudo-conservation law in a cyclic-service system with priority classes. IEICE Research Report, (IN88-86):13–18 (1988)
Srinivasan, M.M.: Non-deterministic polling systems. Manag. Sci. 37, 667–681 (1991)
Takagi, H.: Queuing analysis of polling models. ACM Comput. Surv. (CSUR) 20, 5–28 (1988)
Takagi, H.: Priority queues with setup times. Oper. Res. 38(4), 667–677 (1990)
Takagi, H.: Queueing Analysis: A Foundation of Performance Evaluation, vol. 1: Vacation and Priority Systems, Part 1. North-Holland, Amsterdam (1991)
Wierman, A., Winands, E.M.M., Boxma, O.J.: Scheduling in polling systems. Perform. Eval. 64, 1009–1028 (2007)
Winands, E.M.M.: Polling, production & priorities. Ph.D. thesis, Eindhoven University of Technology (2007)
Winands, E.M.M., Adan, I.J.B.F., van Houtum, G.-J.: Mean value analysis for polling systems. Queueing Syst. 54, 35–44 (2006)
Author information
Authors and Affiliations
Corresponding author
Additional information
The research was done in the framework of the BSIK/BRICKS project, and of the European Network of Excellence Euro-FGI.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Boon, M.A.A., Adan, I.J.B.F. Mixed gated/exhaustive service in a polling model with priorities. Queueing Syst 63, 383 (2009). https://doi.org/10.1007/s11134-009-9115-z
Received:
Revised:
Published:
DOI: https://doi.org/10.1007/s11134-009-9115-z