Braess's paradox in a queueing network with state-dependent routing

Journal of Applied Probability

Volumn 34, Issue 1, 1997, Pages 134-154

  Calvert, Bruce ^a   Solomon, Wiremu ^a   Ziedins, Ilze ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Braess's paradox; Queueing network

Indexed keywords

COMPUTER NETWORKS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; QUEUEING NETWORKS; QUEUEING THEORY;

BRAESS PARADOX; STATE DEPENDENT ROUTING;

PROBABILITY;

EID: 0031082739     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0021900200100774     Document Type: Article

References (27)

1. BEAN, N. G., KELLY, F. P. AND TAYLOR, P. G. (1997) Braess's paradox in loss networks. J. Appl. Prob. 34, 155-159.
2. 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.
3. BLANC, J. P. C. (1990) The power series algorithm applied to the shortest-queue model. Operat. Res. 40, 157-167.
4. BRAESS, D. (1968) Uber ein Paradoxen der Verkehrsplanung. Unternehmenforschung 12, 256-268.
5. CALVERT, B. (1995) The Downs-Thomson effect in a Markov process.
6. CALVERT, B. AND KEADY, G. (1993) Braess's paradox and power-law nonlinearities in networks. J. Austral. Math. Soc. B 35, 1-22.
7. CALVERT, B. AND KEADY, G. (1995) Braess's paradox and power-law nonlinearities in networks II. In Proc. First World Congress of Nonlinear Analysts, WC528 Aug. '92. Vol III. de Gruyter, Berlin. pp. 2223-2230.
8. COHEN, J. E. AND HOROWITZ, P. (1991) Paradoxical behaviour of mechanical and electrical networks. Nature 352, 699-701.
9. COHEN, J. E. AND KELLY, F. P. (1990) A paradox of congestion in a queueing network. J. Appl. Prob. 27, 730-734.
10. FISHWICK, R. A. (1990) SimPack Version 2.2 (ftp.cis.ufl.edu).
11. FOSTER, F. G. (1953) On stochastic matrices associated with various queueing processes. Am. Math. Stat. 24, 355-360.
12. GIBBENS, R. J., HUNT, P. J. AND KELLY, F. P. (1990) Bistability in communication networks. In Disorder in Physical Systems. ed. G. R. Grimmett and D. J. A. Welsh. Oxford University Press, Oxford. pp. 113-127.
13. GIBBENS, R. J., KELLY, F. P. AND KEY, P. B. (1994) Dynamic alternative routing. In Routing and Communication Networks, ed. M. Steenstrup. Prentice Hall, New York.
14. HALFIN, S. (1985) The shortest queue problem. J. Appl. Prob. 22, 865-878.
15. HOUCK, D. J. (1987) Comparison of policies for routing customers to parallel queueing systems. Operat. Res. 35, 306-310.
16. KELLY, F. P. (1991) Network routing. Phil. Trans. R. Soc. Lond. A 337, 343-367.
17. KINGMAN, J. F. C. (1961) Two similar queues in parallel. Ann. Math. Statist. 32, 1314-1323.
18. KUMAR, P. R. AND WALRAND, J. (1985) Individually optimal routing in parallel systems. J. Appl. Prob. 22, 989-995.
19. LAWS, C. N. AND LOUTH, G. M. (1990) Dynamic scheduling of a four-station queueing network. Prob. Eng. Info. Sci. 4, 131-156.
20. MACDOUGALL, M. H. (1987) Simulating Computer Systems: Techniques and Tools. MIT Press, Cambridge, MA.
21. ROSBERG, Z. AND KERMANI, P. (1989) Customer routing to different servers with complete information. Adv. Appl. Prob. 21, 861-882.
22. SOARDI, P. M. (1993) Morphisms and currents in infinite nonlinear resistive networks. Potential Anal. 2, 315-347.
23. WEBER, R. R. (1978) On the optimal assignment of customers to parallel queues. J. Appl. Prob. 15, 406-413.
24. WHITT, W. (1985) Deciding which queue to join: some counterexamples. Operat. Res. 34, 55-62.
25. WINSTON, W. (1977) Optimality of the shortest line discipline. J. Appl. Prob. 14, 181-189.
26. WROE, G. A., COPE, G. A. AND WHITEHEAD, M. J. (1990) Flexible routing in the BT international access network. Proc. Seventh UK Teletraffic Symposium, IEE, Durham.
27. ZUKOWSKI, C. A. AND WYATT, J. L. (1984) Sensitivity of nonlinear one-port resistor networks. IEEE Trans. Circuits and Systems 31, 1048-1051.