Chaoticity on path space for a queueing network with selection of the shortest queue among several

Journal of Applied Probability

Volumn 37, Issue 1, 2000, Pages 198-211

  Graham, Carl ^a,b  

^a ECOLE POLYTECHNIQUE   (France)

^b CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

Author keywords

Chaoticity; Equilibrium; Mean field interaction; Non linear martingale problems; Resource pooling

Indexed keywords

EID: 0034341983     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1014842277     Document Type: Article

References (12)

1. ETHIER, S. and Kurtz, T. (1986). Markov Processes. John Wiley, New York.
2. GRAHAM, C. and Méléard, S. (1993). Propagation of chaos for a fully connected loss network with alternate routing. Stoch. Proc. Appl 44,159-180.
3. GRAHAM, C. and Méléard, S. (1994). Chaos hypothesis for a system interacting through shared resources. Prob. Theory Rel. Fields 100,157-173.
4. GRAHAM, C. and Méléard, S. (1997). Stochastic particle approximations for generalized Boltzmann models and convergence estimates. Ann. Prob. 28,115-132.
5. Martin, J. B. and Suhov, Yu. M. (1999). Fast Jackson networks. Ann. Appl. Prob. 9, 854-870.
6. Shiga, T. and Tanaka, H. (1985). Central limit theorem for a system of Markovian particles with mean field interaction. Z. Wahrscheinlichkeitsth. 69,439-459.
7. STOYAN, D. (1983). Comparison Methods for Queues and other Stochastic Models, ed. D. J. Daley. John Wiley, New York.
8. SZNITMAN, A. S. (1991). Propagation of chaos. In Ecole d’ete de probabilites de Saint-Flour XIX - 1989 (Lecture Notes in Math. 1464). Springer, Berlin, pp. 165-251.
9. TURNER, S. (1998). The effect of increasing routing choice on resource pooling. Prob. Eng. Inf. Sci. 12,109-124.
10. WHITT, W. (1985). Blocking when service is required from several facilities simultaneously. AT& T Tech. J. 64, 1807-1856.
11. VVEDENSKAYA, N. and Suhov, Yu. M. (1997). Dobrushin’s mean-field approximation for a queue with dynamic routing. Markov Proc. Rel. Fields 3, 493-526.
12. VVEDENSKAYA, N., Dobrushin, R. and Karpelevich, F. (1996). Queueing system with selection of the shortest of two queues: an asymptotic approach. Prob. Inf. Trans. 32,15-27.