Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-23T18:25:55.388Z Has data issue: false hasContentIssue false
  • English
  • Français

Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies

Part of: Operations research and management science Computer system organization Special processes

Published online by Cambridge University Press:  21 March 2016

P. Vis ,
R. Bekker  and
R. D. van der Mei
P. Vis*
Affiliation:
VU University Amsterdam and Centre for Mathematics and Computer Science
R. Bekker*
Affiliation:
VU University Amsterdam
R. D. van der Mei*
Affiliation:
VU University Amsterdam and Centre for Mathematics and Computer Science
*
∗ Postal address: VU Amsterdam, Department of Mathematics, De Boelelaan 1105, 1081 HV Amsterdam, The Netherlands.
∗ Postal address: VU Amsterdam, Department of Mathematics, De Boelelaan 1105, 1081 HV Amsterdam, The Netherlands.
∗ Postal address: VU Amsterdam, Department of Mathematics, De Boelelaan 1105, 1081 HV Amsterdam, The Netherlands.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We study cyclic polling models with exhaustive service at each queue under a variety of non-FCFS (first-come-first-served) local service orders, namely last-come-first-served with and without preemption, random-order-of-service, processor sharing, the multi-class priority scheduling with and without preemption, shortest-job-first, and the shortest remaining processing time policy. For each of these policies, we first express the waiting-time distributions in terms of intervisit-time distributions. Next, we use these expressions to derive the asymptotic waiting-time distributions under heavy-traffic assumptions, i.e. when the system tends to saturate. The results show that in all cases the asymptotic waiting-time distribution at queue i is fully characterized and of the form Γ Θi, with Γ and Θi independent, and where Γ is gamma distributed with known parameters (and the same for all scheduling policies). We derive the distribution of the random variable Θi which explicitly expresses the impact of the local service order on the asymptotic waiting-time distribution. The results provide new fundamental insight into the impact of the local scheduling policy on the performance of a general class of polling models. The asymptotic results suggest simple closed-form approximations for the complete waiting-time distributions for stable systems with arbitrary load values.

Keywords

Polling systemservice disciplinewaiting-time distributionheavy traffic

MSC classification

Primary: 60K25: Queueing theory
Secondary: 90B22: Queues and service 68M20: Performance evaluation; queueing; scheduling
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 47 , Issue 4 , December 2015 , pp. 989 - 1014
Copyright
Copyright © Applied Probability Trust 2015 

References

Ayesta, U., Boxma, O. J. and Verloop, I. M. (2012). Sojourn times in a processor sharing queue with multiple vacations. Queueing Systems 71, 53–78.Google Scholar
Baker, K. R. (1984). Sequencing rules and due-date assignments in a job shop. Manag. Sci. 30, 1093–1104.CrossRefGoogle Scholar
Bansal, N. and Gamarnik, D. (2006). Handling load with less stress. Queueing Systems 54, 45–54.CrossRefGoogle Scholar
Bekker, R. et al. (2015). The impact of scheduling policies on the waiting-time distributions in polling systems. Queueing Systems 79, 145–172.Google Scholar
Boon, M. A. A. (2011). Polling models: from theory to traffic intersections. Doctoral thesis, Eindhoven University of Technology.Google Scholar
Boon, M. A. A., Adan, I. J. B. F. and Boxma, O. J. (2010). A polling model with multiple priority levels. Performance Evaluation 67, 468–484.CrossRefGoogle Scholar
Boon, M. A. A., Adan, I. J. B. F. and Boxma, O. J. (2010). A two-queue polling model with two priority levels in the first queue. Discrete Event Dynamic Systems 20, 511–536.Google Scholar
Boon, M. A. A., van der Mei, R. D. and Winands, E. M. M. (2011). Applications of polling systems. Surveys Operat. Res. Manag. Sci. 16, 67–82.Google Scholar
Borst, S. C., Boxma, O. J., Morrison, J. A. and Queija, R. Núñez (2003). The equivalence between processor sharing and service in random order. Operat. Res. Lett. 31, 254–262.CrossRefGoogle Scholar
Boxma, O., Bruin, J. and Fralix, B. (2009). Sojourn times in polling systems with various service disciplines. Performance Evaluation 66, 621–639.CrossRefGoogle Scholar
Coffman, E. G. Jr, Puhalskii, A. A. and Reiman, M. I. (1995). Polling systems with zero switchover times: a heavy-traffic averaging principle. Ann. Appl. Prob. 5, 681–719.Google Scholar
Coffman, E. G. Jr, Puhalskii, A. A. and Reiman, M. I. (1998). Polling systems in heavy traffic: a Bessel process limit. Math. Operat. Res. 23, 257–304.CrossRefGoogle Scholar
Ehrlich, W. K., Hariharan, R., Reeser, P. K. and van der Mei, R. D. (2001). Performance of web servers in a distributed computing environment. In Teletraffic Engineering in the Internet Era, Elsevier, Amsterdam, pp. 137–148.Google Scholar
Harchol-Balter, M. (2009). Queueing Disciplines. In Wiley Encyclopedia of Operations Research and Management Science, John Wiley, New York, 13 pp.Google Scholar
Kawasaki, N. et al. (2000). Waiting time analysis of M X /G/1 queues with/without vacations under random order of service discipline. J. Operat. Res. Soc. Japan 43, 455–468.Google Scholar
Kella, O. and Yechiali, U. (1988). Priorities in M/G1 queue with server vacations. Naval Res. Logistics 35, 23–34.Google Scholar
Kingman, J. F. C. (1962). On queues in which customers are served in random order. Proc. Cambridge Phil. Soc. 58, 79–91.Google Scholar
Olsen, T. L. and van der Mei, R. D. (2003). Polling systems with periodic server routeing in heavy traffic: distribution of the delay. J. Appl. Prob. 40, 305–326.CrossRefGoogle Scholar
Scholl, M. and Kleinrock, L. (1983). On the M/G1 queue with rest periods and certain service-independent queueing disciplines. Operat. Res. 31, 705–719.Google Scholar
Schrage, L. E. and Miller, L. W. (1966). The queue M/G1 with the shortest remaining processing time discipline. Operat. Res. 14, 670–684.Google Scholar
Takagi, H. (1986). Analysis of Polling Systems. MIT Press, Cambridge, MA.Google Scholar
Takagi, H. and Kudoh, S. (1997). Symbolic higher-order moments of the waiting time in an M/G1 queue with random order of service. Commun. Statist. Stoch. Models 13, 167–179.Google Scholar
Tijms, H. C. (2003). A First Course in Stochastic Models. John Wiley, Chichester.CrossRefGoogle Scholar
Van der Mei, R. D. (1999). Distribution of the delay in polling systems in heavy traffic. Performance Evaluation 38, 133–148.CrossRefGoogle Scholar
Van der Mei, R. D. (2000). Polling systems with switch-over times under heavy load: moments of the delay. Queueing Systems 36, 381–404.Google Scholar
Van der Mei, R. D. (2007). Towards a unifying theory on branching-type polling systems in heavy traffic. Queueing Systems 57, 29–46.CrossRefGoogle Scholar
Van der Mei, R. D., Hariharan, R. and Reeser, P. K. (2001). Web server performance modeling. Telecommun. Systems 16, 361–378.Google Scholar
Van Dorp, J. R. and Kotz, S. (2003). Generalized trapezoidal distributions. Metrika 58, 85–97.Google Scholar
Vis, P., Bekker, R. and van der Mei, R. D. (2014). Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies. Tech. Rep. ST-1401, CWI.Google Scholar
Vishnevskii, V. M. and Semenova, O. V. (2006). Mathematical methods to study the polling systems. Automation Remote Control 67, 173–220.Google Scholar
Wierman, A., Winands, E. M. M. and Boxma, O. J. (2007). Scheduling in polling systems. Performance Evaluation 64, 1009–1028.CrossRefGoogle Scholar
Winands, E. M. M., Adan, I. J. B. F. and van Houtum, G. J. (2006). Mean value analysis for polling systems. Queueing Systems 54, 35–44.CrossRefGoogle Scholar