Braess's paradox in a loss network

Journal of Applied Probability

Volumn 34, Issue 1, 1997, Pages 155-159

  Bean, N G ^a   Kelly, F P ^a   Taylor, P G ^a  

^a NONE

Author keywords

Blocking probabilities; Braess's paradox; Loss networks

Indexed keywords

BLOCKING PROBABILITY; BRAESS PARADOX; LOSS NETWORK;

MATHEMATICAL MODELS; OPERATIONS RESEARCH; ROADS AND STREETS;

PROBABILITY;

EID: 0031082696     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0021900200100786     Document Type: Article

References (23)

1. BELL, C. E. AND STIDHAM, S. JR. (1983) Individual versus social optimization in the allocation of customers to alternative servers. Management Sci. 29, 831-839
2. BRAESS, D. (1968) Uber ein Paradoxen der Verkehrsplannung. Unternehmensforschung 12, 258-268.
3. CALVERT, B. AND KEADY, G. (1993) Braess's paradox and power-law nonlinearities in networks. J. Austral. Math. Soc. B 35, 1-22.
4. CALVERT, B., SOLOMON, W. AND ZIEDINS, I. (1997) Braess's paradox in a queueing network with state dependent routing. J. Appl. Prob. 34, 134-154.
5. COHEN, J. E. AND HOROWITZ, P. (1991) Paradoxical behaviour of mechanical and electrical networks. Nature 352, 699-701.
6. COHEN, J. E. AND KELLY, F. P. (1990) A paradox of congestion in a queueing network. J. Appl. Prob. 27, 730-734.
7. FISK, C. (1979) More paradoxes in the equilibrium assignment problem. Transportation Res. B: Methodological 13, 305-309.
8. FRANK, M. (1981) The Braess paradox. Math. Prog. 20, 283-302.
9. GIBBENS, R. J., HUNT, P. J. AND KELLY, F. P. (1989) Bistability in communication networks. In Disorder in Physical Systems. ed. G. R. Grimmett and D. J. A. Walsh. Oxford University Press, Oxford. pp. 113-128.
10. IRVINE, A. D. (1993) How Braess' paradox solves Newcomb's problem. Int. Studies Phil. Sci. 7, 141-160.
11. KELLY, F. P. (1988) Routing in circuit-switched networks: optimization, shadow prices and decentralization. Adv. Appl. Prob. 20, 112-144.
12. KELLY, F. P. (1991) Loss networks. Ann. Appl. Prob. 1, 319-378.
13. KELLY, F. P. (1991) Network routing. Phil. Trans. R. Soc. London A 337, 343-367.
14. KNÖDEL, W. (1969) Graphentheoretische Methoden und ihre Anwendungen. Springer, Berlin.
15. KRUPP, R. S. (1982) Stabilization of alternate routing networks. In IEEE International Communications Conference. Paper 31.2.
16. LABLANC, L. J. (1975) An algorithm for the discrete network design problem. Transportation Sci. 9, 183-199.
17. MURCHLAND, J. D. (1970) Braess's paradox of traffic flow. Transportation Res. 4, 391-394.
18. NAKAGOME, Y. AND MORI, H. (1973) Flexible routing in the global communication network. In Seventh International Teletraffic Congress, ITC'7. Stockholm.
19. STEINBERG, R. AND ZANGWILL, W. I. (1983) The prevalence of Braess' paradox. Transportation Sci. 17, 301-318.
20. STEWART, N. F. (1980) Equilibrium vs system-optimal flow: some examples. Transportation Res. A: General. 14, 81-84.
21. WARDROP, J. G. (1952) Some theoretical aspects of road traffic research. Proc. Inst. Civil Eng. II 1, 325-378.
22. WHITT, W. (1992) Counterexamples for comparisons of queues with finite waiting rooms. Queueing Systems 10, 271-278.
23. WROE, G. A., COPE, G. A. AND WHITEHEAD, M. J. (1990) Flexible routing in the BT international access network. In 7th United Kingdom Teletraffic Symposium, Durham. pp. 21/1-21/7.