Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-26T05:56:27.175Z Has data issue: false hasContentIssue false
  • English
  • Français

Expected delay analysis of polling systems in heavy traffic

Part of: Special processes Operations research and management science

Published online by Cambridge University Press:  01 July 2016

R. D. van der Mei  and
H. Levy
R. D. van der Mei*
Affiliation:
AT&T Labs
H. Levy*
Affiliation:
Tel-Aviv University
*
∗ Postal address: AT&T Labs, P.O. Box 3030, Holmdel, NJ 07733, USA. Email address: hanoch@math.tau.ac.il
∗∗ Postal address: Tel-Aviv University, Department of Computer Science, Tel Aviv, Israel.
Get access Rights & Permissions [Opens in a new window]

Abstract

We study the expected delay in a cyclic polling model with mixtures of exhaustive and gated service in heavy traffic. We obtain closed-form expressions for the mean delay under standard heavy-traffic scalings, providing new insights into the behaviour of polling systems in heavy traffic. The results lead to excellent approximations of the expected waiting times in practical heavy-load scenarios and moreover, lead to new results for optimizing the system performance with respect to the service disciplines.

Keywords

polling systemsheavy trafficexpected delayoptimization

MSC classification

Primary: 60K25: Queueing theory
Secondary: 90B22: Queues and service
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 30 , Issue 2 , June 1998 , pp. 586 - 602
Copyright
Copyright © Applied Probability Trust 1998 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Athreya, K. B and Ney, P. E. (1971). Branching Processes. Springer, Berlin.Google Scholar
[2] Blanc, J. P. C. (1992). Performance evaluation of polling systems by means of the power-series algorithm. Ann. Operat. Res. 35, 155–186.Google Scholar
[3] Blanc, J. P. C. and Van der Mei, R. D. (1995). Optimization of polling systems with Bernoulli schedules. Perf. Eval. 22, 139–158.Google Scholar
[4] Boxma, O. J. and Groenendijk, W. P. (1987). Pseudo-conservation laws in cyclic service systems. J. Appl. Prob. 24, 949–964.Google Scholar
[5] Choudhury, G. and Whitt, W. (1994). Computing transient and steady state distributions in polling models by numerical transform inversion. Perf. Eval. 25, 267–292.Google Scholar
[6] Coffman, E. G., Puhalskii, A. A. and Reiman, M. I. (1995). Polling systems with zero switch-over times: a heavy-traffic principle. Ann. Appl. Prob. 5, 681–719.Google Scholar
[7] Coffman, E. G., Puhalskii, A. A. and Reiman, M. I. (1995). Polling systems in heavy-traffic: a Bessel process limit. To appear in Math. Oper. Res.Google Scholar
[8] Groenendijk, W. P. (1988). Waiting-time approximations for cyclic-service systems with mixed service strategies. In Teletraffic Science for New Cost-Effective Systems, ed. Bonatti, M.. North-Holland, Amsterdam, pp. 1434–1441.Google Scholar
[9] Fricker, C. and Jaïbi, M. R. (1994). Monotonicity and stability of periodic polling models. Queueing Systems 15, 211–238.Google Scholar
[10] Karlin, S. (1966). A First Course in Stochastic Processes. Academic Press, New York.Google Scholar
[11] Kato, T. (1966). Perturbation Theory for Linear Operators. Springer, New York.Google Scholar
[12] Konheim, A. G., Levy, H. and Srinivasan, M. M. (1994). Descendant set: an efficient approach for the analysis of polling systems. IEEE Trans. Comm. 42, 1245–1253.Google Scholar
[13] Leung, K. K. (1991). Cyclic service systems with probabilistically-limited service. IEEE J. Sel. Areas Commun. 9, 185–193.Google Scholar
[14] Levy, H. and Sidi, M. (1991). Polling models: applications, modeling and optimization. IEEE Trans. Commun. 38, 1750–1760.Google Scholar
[15] Levy, H., Sidi, M. and Boxma, O. J. (1990). Dominance relations in polling systems. Queueing systems 6, 155–171.Google Scholar
[16] Markowitz, D. (1995). Dynamic Scheduling of Single-Server Queues with Setups: A Heavy Traffic Approach. , Operations research Center, MIT, Cambridge, MA.Google Scholar
[17] Reiman, M. I. and Wein, L. M. (1998). Dynamic scheduling of a two-class queue with setups. To appear in Math. Oper. Res. Technical report, Sloan School of Management, MIT, Cambridge, MA.Google Scholar
[18] Resing, J. A. C. (1993). Polling systems and multitype branching processes. Queueing Systems 13, 409–426.Google Scholar
[19] Srinivasan, M. M., Levy, H. and Konheim, A. G. (1996). The individual station technique for the analysis of cyclic polling systems. Naval Research Logistics 73, 79–101.Google Scholar
[20] Takagi, H. (1986). Analysis of Polling Systems. The MIT Press, Cambridge, MA.Google Scholar
[21] Takagi, H. (1990). Queueing analysis of polling models: an update. In Stochastic Analysis of Computer and Communication Systems, ed. Takagi, H.. North-Holland, Amsterdam, pp. 267–318.Google Scholar
[22] Takagi, H. (1994). Queueing analysis of polling models: progress in 1990–1993. In Frontiers in Queueing: Models, Methods and Problems, ed. J. H. Dshalalow. CRC Press.Google Scholar
[23] Van der Mei, R. D. and Levy, H. (1996). Expected delay analysis of polling systems in heavy traffic. Technical Report RRR 17–96, RUTCOR, Rutgers University.Google Scholar
[24] Van der Mei, R. D. and Levy, H. (1997). Polling systems in heavy traffic: exhaustiveness of the service policies. Queueing Systems and their applications 27, 227–250.Google Scholar
[25] Van der Mei, R. D. (1997). Polling systems in heavy traffic: higher moments of the delay. In Teletraffic Contributions for the Information Age, eds. Ramaswamy, V. and Wirth, P. E.. Elsevier, Amsterdam, pp. 275–284.Google Scholar