Braess's paradox in a loss network

Braess's paradox is said to occur in a network if the addition of an extra link leads to worse performance. It has been shown to occur in transportation networks (such as road networks) and also in queueing networks. Here, we show that it can occur in loss networks.

[1]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[2]  Walter Knödel,et al.  Graphentheoretische Methoden und ihre Anwendungen , 1969 .

[3]  J. D. Murchland,et al.  Braess's paradox of traffic flow , 1970 .

[4]  Larry J. LeBlanc,et al.  An Algorithm for the Discrete Network Design Problem , 1975 .

[5]  C. Fisk.  More paradoxes in the equilibrium assignment problem , 1979 .

[6]  N. F. Stewart.  Equilibrium vs system-optimal flow: Some examples , 1980 .

[7]  Marguerite FRANK,et al.  The Braess paradox , 1981, Math. Program..

[8]  S. Stidham,et al.  Individual versus Social Optimization in the Allocation of Customers to Alternative Servers , 1983 .

[9]  Richard Steinberg,et al.  PREVALENCE OF BRAESS' PARADOX , 1983 .

[10]  F. Kelly.  Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.

[11]  Joel E. Cohen,et al.  A paradox of congestion in a queuing network , 1990, Journal of Applied Probability.

[12]  Joel E. Cohen,et al.  Paradoxical behaviour of mechanical and electrical networks , 1991, Nature.

[13]  Ward Whitt,et al.  Counterexamples for comparisons of queues with finite waiting rooms , 1992, Queueing Syst. Theory Appl..

[14]  B. Calvert,et al.  Braess's paradox and power-law nonlinearities in networks , 1993, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[15]  A. Irvine.  How Braess’ paradox solves Newcomb's problem* , 1993 .

[16]  I. Ziedins,et al.  Braess's Paradox in a Queueing Network with State-Dependent Routing , 1997 .