Fast Jackson networks

Annals of Applied Probability

Volumn 9, Issue 3, 1999, Pages 854-870

  Martin, J B ^a   Suhov, Yu M ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Dynamic routing; Jackson network; Markov process; Queueing network; Superexponential decay

Indexed keywords

EID: 0033249381     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1029962816     Document Type: Article

References (9)

1. ETHIER, S. N. and KURTZ, T. G. (1985). Markov Processes: Characterization and Convergence. Wiley, New York.
2. JACKSON, J. R. (1957). Networks of waiting times. Oper. Res. 5 518-527.
3. JACKSON, J. R. (1965). Jobshop-like queueing systems. Management Sci. 10 131-142.
4. KARPELEVICH, F. I., PECHERSKY, E. A. and SUHOV, Y. M. (1996). Dobrushin's approach to queueing network theory. J. Appl. Math. Stochastic Anal. 9 373-397.
5. KELLY, F. P. (1991). Loss networks. Ann. Appl. Probab. 1 319-378.
6. MITZENMACHER, M. (1996). The power of two choices in randomized load balancing. Ph.D. dissertation, Univ. California, Berkeley.
7. TURNER, S. R. E. (1998). The effect of increasing routing choice on resource pooling. Probab. Engrg. Inform. Sci. 12 109-124.
8. VVEDENSKAYA, N. D., DOBRUSHIN, R. L. and KARPELEVICH, F. I. (1996). Queueing system with selection of the shortest of two queues: An asymptotic approach. Problems Inform. Transmission 32 15-27.
9. VVEDENSKAYA, N. D. and SUHOV, Y. M. (1997). Dobrushin's mean-field approximation for a queue with dynamic routing. Markov Processes and Related Fields 3 493-526.