Polling systems in heavy traffic: A Bessel process limit

Mathematics of Operations Research

Volumn 23, Issue 2, 1998, Pages 257-304

  Coffman Jr , E G ^a   Puhalskii, A A ^b   Reiman, M I ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

Averaging principles; Bessel process; Heavy traffic limit; Polling systems; Semi martingales

Indexed keywords

NUMERICAL METHODS; PERFORMANCE; QUEUEING THEORY; SWITCHING SYSTEMS; TELECOMMUNICATION SERVICES; TELECOMMUNICATION SYSTEMS; TELECOMMUNICATION TRAFFIC;

AVERAGING PRINCIPLES; BESSEL PROCESS LIMIT; NONZERO SWITCHOVER TIME; POLLING SYSTEMS;

MATHEMATICAL MODELS;

EID: 0032075277     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.23.2.257     Document Type: Article

References (20)

1. Billingsley, P. (1968). Convergence of Probability Measures. Wiley, New York.
2. Chen, H., A. Mandelbaum (1991). Leontief systems, RBV's and RBM's. M. H. A. Davis, R. J. Elliott, eds., Proceedings of the Imperial College Workshop on Applied Stochastic Processes. Gordon and Breach Science Publishers, London.
3. Coffman, Jr., E. G., A. A. Puhalskii, M. I. Reiman (1991). Storage limited queues in heavy traffic. Prob. Eng. Inf. Sci. 5 499-522.
4. _, _, _ (1995). Polling systems with zero switchover times: A heavy traffic averaging principle. Ann. Appl. Prob. 5 681-719.
5. Iglehart, D. L., W. Whitt (1970). Multiple channel queues in heavy traffic, I and H. Adv. Appl. Prob. 2 150-177 and 355-364.
6. Ikeda, N., S. Watanabe (1989). Stochastic Differential Equations and Diffusion Processes. North Holland, Amsterdam/Oxford/New York.
7. Jacod, J., A. N. Shiryaev (1987). Limit Theorems for Stochastic Processes. Springer, Berlin/Heidelberg/New York/London/Paris/Tokyo.
8. Kruskal, J. B. (1969). Work scheduling algorithms: A nonprobabilistic queueing study (with possible application to No. 1 ESS). Bell Sys. Tech. J. 48 2963-2974.
9. Leung, K. K. (1991). Cyclic-service systems with probabilistically-limited service. IEEE J. Sel. Areas Comm. 9, 185-193.
10. Levy, H., M. Sidi (1990). Polling systems: Applications, modeling, and optimization. IEEE Trans. Comm. 38 1750-1760.
11. Liptser, R. Sh., A. N. Shiryaev (1989). Theory of Martingales. Kluwer, Dordrecht/Boston/London.
12. Olsen, T. (1998). Approximations for the waiting time in polling models with and without state-dependent set ups. TR 98-1. Industrial and Operations Engineering Dept., University of Michigan, Ann Arbor, MI.
13. Reiman, M. I. (1988). A multiclass feedback queue in heavy traffic. Adv. Appl. Prob. 2 179-207.
14. _, L. M. Wein (1995). Dynamic scheduling of a two-class queue with setups. Oper. Res. to appear.
15. Rosenkrantz, W. A. (1984). Weak convergence of a sequence of queueing and storage processes to a singular diffusion, F. Baccelli, G. Fayolle, eds., Lect. Notes in Control Inform. Sci., vol. 60. Springer-Verlag, Berlin-Heidelberg-New York-Tokyo, 257-272.
16. Takagi, H. (1986). Analysis of Polling Systems. The MIT Press, Cambridge, MA.
17. _ (1990). Queueing analysis of polling models: An update. H. Takagi, ed., Stochastic Analysis of Computer and Communication Systems. North Holland, Amsterdam.
18. Whitt, W. (1980). Some useful functions for functional limit theorems. Math. Oper. Res. 5 67-85.
19. Yamada, K. (1984). Diffusion approximations for storage processes with general release rules. Math. Oper. Res. 9 459-470.
20. _ (1986). Multi-dimensional Bessel processes as heavy traffic limits of certain tandem queues. Stock. Proc. Appl. 23 35-56.