Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-25T08:12:16.112Z Has data issue: false hasContentIssue false
  • English
  • Français

Delay in polling systems with large switch-over times

Part of: Operations research and management science Special processes

Published online by Cambridge University Press:  14 July 2016

R. D. van der Mei
R. D. van der Mei*
Affiliation:
AT&T Lab
*
∗Postal address: Network Design and Performance Analysis Department, AT&T Labs, Advanced Technologies, 200 Laurel Avenue, Middletown, NJ 07748, USA. Email address: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We study the delay in cyclic polling systems with mixtures of gated and exhaustive service, and with deterministic switch-over times. We show that, under proper scalings, the waiting-time distribution at each of the queues converges to a uniform distribution over a known interval when the switch-over times tend to infinity.

Keywords

polling systemsswitch-over timesdelay distributionasymptotics

MSC classification

Primary: 60K25: Queueing theory
Secondary: 90B22: Queues and service
Type
Research Papers
Information
Journal of Applied Probability , Volume 36 , Issue 1 , March 1999 , pp. 232 - 243
Copyright
Copyright © Applied Probability Trust 1999 

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

Blanc, J. P. C. (1992). Performance evaluation of polling systems by means of the power-series algorithm. Ann. Oper. Res. 35, 155–186.CrossRefGoogle Scholar
Boxma, O. J., and Groenendijk, W. P. (1988). Pseudo-conservation laws in cyclic service systems. J. Appl. Prob. 24, 949–964.CrossRefGoogle Scholar
Bozer, Y. A., and Srinivasan, M. M. (1991). Tandem configurations for automated guided vehicle systems and the analysis of single loops. IIE Trans. 23, 72–82.CrossRefGoogle Scholar
Bunday, B. D., and El-Badri, W. K. (1988). The efficiency of M groups of machines served by a travelling robot: comparison of two models. Internat. J. Prod. Res. 26, 299–308.CrossRefGoogle Scholar
Choudhury, G., and Whitt, W. (1996). Computing transient and steady state distributions in polling models by numerical transform inversion. Perf. Eval. 25, 267–292.CrossRefGoogle Scholar
Dukhovnyy, I. M. (1979). An approximate model of motion of urban passenger transportation over annular routes. Eng. Cybern. 17, 161–162.Google Scholar
Feller, W. (1971). An Introduction to Probability Theory and Its Applications, 2nd edn. Wiley, New York.Google Scholar
Fricker, C. and Jaïbi, M. R. (1994). Monotonicity and stability of periodic polling models. Queueing Systems 15, 211–238.CrossRefGoogle Scholar
Fuhrmann, S. W. (1992). A decomposition result for a class of polling models. Queueing Systems 11, 109–120.CrossRefGoogle Scholar
Fuhrmann, S. W., and Cooper, R. B. (1985). Stochastic decompositions in the M/G/1 queue with generalized vacations. Operat. Res. 33, 1117–1129.CrossRefGoogle Scholar
Gamse, B., and Newel, G. F. (1982). An analysis of elevator operation in moderate height buildings–-A single elevator. Transp. Res. B 16, 303–319.CrossRefGoogle Scholar
Heyman, D. P., and Sobel, M. J. (1982). Stochastic Models in Operations Research, Vol. 1. McGraw-Hill, New York.Google Scholar
Konheim, A. G., Levy, H., and Srinivasan, M. M. (1994). Descendant set: an efficient approach for the analysis of polling systems. IEEE Trans. Commun. 42, 1245–1253.CrossRefGoogle Scholar
Leung, K. K. (1991). Cyclic service systems with probabilistically-limited service. IEEE J. Sel. Areas Commun. 9, 185–193.CrossRefGoogle Scholar
Levy, H., and Sidi, M. (1991). Polling models: applications, modeling and optimization. IEEE Trans. Commun. 38, 1750–1760.CrossRefGoogle Scholar
Mack, C., Murphy, T., and Webb, N. L. (1957). The efficiency of N machines unidirectionally patrolled by one operative when walking times and repair times are constants. J. Roy. Statist. Soc. B 19, 166–172.Google Scholar
Nahmias, S., and Rothkopf, M. H. (1984). Stochastic models for internal mail delivery systems. Management Sci. 30, 1113–1120.CrossRefGoogle Scholar
Resing, J. A. C. (1993). Polling systems and multitype branching processes. Queueing Systems 13, 409–426.CrossRefGoogle Scholar
Srinivasan, M. M., Niu, S.-C., and Cooper, R. B. (1995). Relating polling models with zero and nonzero switch-over times. Queueing Systems 19, 149–168.CrossRefGoogle Scholar
Takagi, H. (1986). Analysis of Polling Systems. MIT Press, Cambridge, MA.Google Scholar
Takagi, H. (1990). Queueing analysis of polling models: an update. In Stochastic Analysis of Computer and Communication Systems, ed. Takagi, H. North-Holland, Amsterdam, 267–318.Google Scholar
Takagi, H. (1997). Queueing analysis of polling models: progress in 1990–1994. In Frontiers in Queueing: Models and Applications in Science and Technology, ed. Dshalalow, J. H. CRC Press, Boca Raton, FL, pp. 119–144.Google Scholar
Van der Mei, R. D., and Levy, H. (1998). Mean delay analysis of polling systems in heavy traffic. Adv. Appl. Prob. 30, 586–602.CrossRefGoogle Scholar
Van der Mei, R. D. (1998). Polling systems in heavy traffic: higher moments of the delay. To appear in Queueing Systems.Google Scholar