The effect of increasing routing choice on resource pooling

Probability in the Engineering and Informational Sciences

Volumn 12, Issue 1, 1998, Pages 109-124

  Turner, Stephen R E ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ENGINEERING; INDUSTRIAL ENGINEERING;

LIMITING DISTRIBUTIONS; PERFORMANCE GAIN; QUEUE LENGTHS; RESOURCE POOLING;

QUEUEING THEORY;

EID: 0032345345     PISSN: 02699648     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0269964800005088     Document Type: Article

References (24)

1. Billingsley, P. (1968). Convergence of probability measures. New York: John Wiley & Sons.
2. Crametz, J.-P. & Hunt, P.J. (1991). A limit result respecting graph structure for a fully connected loss network with alternative routing. Annals of Applied Probability 1: 436-444.
3. Ethier, S.N. & Kurtz, T.G. (1986). Markov processes: Characterization and convergence. New York: John Wiley & Sons.
4. Foschini, G.J. & Salz, J. (1978). A basic dynamic routing problem and diffusion. IEEE Transactions on Communications 26: 320-327.
5. Gibbens, R.J., Hunt, P.J., & Kelly, P.P. (1990). Bistability in communication networks. In G.R. Grimmett & D.J.A. Welsh (eds.), Disorder in physical systems, pp. 113-127. Oxford: Oxford University Press.
6. Gibbens, R.J., Kelly, P.P., & Turner, S.R.E. (1993). Dynamic routing in multiparented networks. IEEE/ACM Transactions on Networking 1: 261-270.
7. Hajek, B. (1990). Performance of global load balancing by local adjustment. IEEE Transactions on Information Theory 36: 1398-1414.
8. Harrison, J.M. (1985). Brownian motion and stochastic flow systems. New York: John Wiley & Sons.
9. Harrison, J.M. & van Mieghem, J.A. (1997). Dynamic control of Brownian networks: State space collapse and equivalent workload formulations. Annals of Applied Probability 7: 747-771.
10. Hunt, P.J. (1990). Limit theorems for stochastic loss networks. Ph.D. thesis, University of Cambridge.
11. Hunt, P.J. (1995). Loss networks under diverse routing, I. The symmetric star network. Advances in Applied Probability 27: 255-272.
12. Hunt, P.J. & Laws, C.N. (1992). Least busy alternative routing inqueueingand loss networks. Probability in the Engineering and Informational Sciences 6: 439-456.
13. Hunt, P.J. & Laws, C.N. (1993). Asymptotically optimal loss network control. Mathematics of Operations Research 18: 880-900.
14. Hunt, P.J., Laws, C.N., & Pitsilis, E. (1993). Asymptotically optimal dynamic routing in fully connected queueing networks. Research Report 1993-19, University of Cambridge Statistical Laboratory.
15. Kelly, F.P. (1991). Loss networks. Annals of Applied Probability 1: 319-378.
16. Kelly, F.P. & Laws, C.N. (1993). Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling. Queueing Systems: Theory and Applications 13: 47-86.
17. Reiman, M.I. (1984). Some diffusion approximations with state space collapse. In P. Baccelli & G. Fayolle (eds.), Modelling and performance evaluation methodology, Lecture Notes in Control and Information Sciences, number 60, INRIA. Berlin: Springer-Verlag.
18. Rogers, L.C.G. & Williams, D. (1994). Diffusions, Markov processes, and martingales, Vol. 1: Foundations, 2nd ed. New York: John Wiley & Sons.
19. Stoyan, D. (1983). Comparison methods for queues and other stochastic models. Translated from German, D.J. Daley (ed.), New York: John Wiley & Sons.
20. Turner, S.R.E. (1996). A join the shorter queue model in heavy traffic. Research Report 1996-1, University of Cambridge Statistical Laboratory.
21. Turner, S.R.E. (1997). Resource pooling via large deviations (in preparation).
22. Vvedenskaya, N.D., Dobrushin, R.L., & Karpelevich, F.I. (1996). Queueing system with the selection of the shortest of two queues: An asymptotic approach. Problems of Information Transmission 32: 15-27.
23. Whitt, W. (1980). Some useful functions for functional limit theorems. Mathematics of Operations Research 5: 67-85.
24. Whitt, W. (1985). Blocking when service is required from several facilities simultaneously. AT&T Technical Journal 64: 1807-1856.