Distribution of the delay in polling systems in heavy traffic

Performance Evaluation

Volumn 38, Issue 2, 1999, Pages 133-148

  Van Der Mei, R D ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; LAPLACE TRANSFORMS; PROBABILITY DISTRIBUTIONS; VALUE ENGINEERING;

ASYMMETRIC CYCLIC POLLING SYSTEMS; FAST-TO-EVALUATE APPROXIMATIONS; LAPLACE-STIELTJES TRANSFORMS (LST);

QUEUEING THEORY;

EID: 0033329724     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(99)00048-6     Document Type: Article

References (34)

1. J.P.C. Blanc, Performance analysis and optimization with the power-series algorithm, in: L. Donatiello, R. Nelson (Eds.), Performance Evaluation of Computer and Communication Systems, Springer, Berlin, 1993, pp. 53-80.
2. Borst S.C., Boxma O.J. Polling models with and without switchover times. Oper. Res. 45:1997;536-543.
3. Borst S.C., Boxma O.J., Levy H. The use of service limits for efficient operation of multistation single-medium communication systems. IEEE Trans. Networks. 3:1995;602-612.
4. Boxma O.J., Groenendijk W.P. Pseudo-conservation laws in cyclic-service systems. J. Appl. Probab. 24:1987;949-964.
5. O.J. Boxma, W.P. Groenendijk, Two queues with alternating service and switching times, in: O.J. Boxma, R. Syski (Eds.), Queueing Theory and its Applications - Liber Amicorum for J.W. Cohen, North-Holland, Amsterdam, 1988, pp. 261-282.
6. O.J. Boxma, J.W. Cohen, The single server queue: heavy tails and heavy traffic, in: K. Park, W. Willinger (Eds.), Self-Similar Network Traffic and Performance Evaluation, Wiley, New York, in press.
7. O.J. Boxma, Q. Deng, J.A.C. Resing, Polling systems with regularly varying service and/or switch-over times, Technical Report, COSOR 99-10.
8. Choudhury G., Whitt W. Computing transient and steady state distributions in polling models by numerical transform inversion. Perf. Eval. 25:1996;267-292.
9. K.L. Chung, A Course in Probability, 2nd ed., Academic Press, New York, 1974.
10. Coffman E.G., Puhalskii A.A., Reiman M.I. Polling systems with zero switch-over times: a heavy-traffic principle. Ann. Appl. Probab. 5:1995;681-719.
11. Coffman E.G., Puhalskii A.A., Reiman M.I. Polling systems in heavy-traffic: a Bessel process limit. Math. Oper. Res. 23:1998;257-304.
12. J.W. Cohen, O.J. Boxma, The M/G/1 queue with alternating service formulated as a Rieman-Hilbert boundary value problem, in: F.J. Kylstra (Ed.), Performance 1981, North-Holland, Amsterdam, 1981, pp. 181-199.
13. Duffield N.G. Exponents for the tails of distributions in some polling models. Queueing Systems. 26:1997;105-119.
14. Eisenberg M. Two queues with alternating service. SIAM J. Appl. Math. 36:1979;287-303.
15. Federgruen A., Katalan Z. Approximating queue size and waiting-time distributions in general polling systems. Queueing Systems. 18:1994;353-386.
16. W. Feller, An Introduction to Probability Theory and its Applications, 2nd ed.,Wiley, New York, 1970.
17. Fricker C., Jaïbi M.R. Monotonicity and stability of periodic polling models. Queueing Systems. 15:1994;211-238.
18. Konheim A.G., Levy H., Srinivasan M.M. Descendant set: an efficient approach for the analysis of polling systems. IEEE Trans. Commun. 42:1994;1245-1253.
19. Kroese D.P. Heavy traffic analysis for continuous polling models. J. Appl. Probab. 34:1997;720-732.
20. Leung K.K. Cyclic service systems with probabilistically-limited service. IEEE J. Sel. Areas Commun. 9:1991;185-193.
21. Levy H., Sidi M. Polling models: applications, modeling and optimization. IEEE Trans. Commun. 38:1991;1750-1760.
22. Levy H., Sidi M., Boxma O.J. Dominance relations in polling systems. Queueing Systems. 6:1990;155-171.
23. Reiman M.I., Wein L.M. Dynamic scheduling of a two-class queue with setups. Oper. Res. 46:1998;532-547.
24. Srinivasan M.M., Niu S.C., Cooper R.B. Relating polling models with zero and nonzero switchover times. Queueing Systems. 19:1995;149-168.
25. H. Takagi, Queueing analysis of polling models: an update, in: H. Takagi (Ed.), Stochastic Analysis of Computer and Communication Systems, North-Holland, Amsterdam, 1990, pp. 267-318.
26. H. Takagi, Queueing analysis of polling models: progress in 1990-1994, in: J.H. Dshalalow (Ed.), Frontiers in Queueing: Models, Methods and Problems, CRC Press, Boca Raton, 1997, pp. 119-146.
27. Van der Mei R.D., Levy H. Expected delay in polling systems in heavy traffic. Adv. Appl. Probab. 30:1998;586-602.
28. Van der Mei R.D., Levy H. Polling systems in heavy traffic: exhaustiveness of the service policies. Queueing Systems. 27:1997;227-250.
29. Van der Mei R.D. Polling systems in heavy traffic: higher moments of the delay. Queueing Systems. 31:1999;265-294.
30. R.D. Van der Mei, Polling systems with switch-over times under heavy load: moments of delay, Queueing Systems, to appear.
31. Van der Mei R.D. Polling systems with periodic server routing in heavy traffic. Stochast. Models. 15:1999;273-297.
32. R.D. Van der Mei, Delay in polling systems with large switch-over times, J. Appl. Probab. 36 (1999) 232-243.
33. R.D. Van der Mei, Waiting-time distributions in polling systems in heavy traffic, in: P. Key, D. Smith (Eds.), Teletraffic Engineering in a Competitive World, Elsevier, Amsterdam, 1999, pp. 325-334.
34. Weststrate J.A., Van der Mei R.D. Waiting times in a two-queue model with exhaustive and Bernoulli service. Z.O.R. Math. Meth. Oper. Res. 40:1994;289-303.