Avoiding the Braess paradox in non-cooperative networks

The exponentialgrowth of computer networking demands massive upgrades in the capacity of existing networks. Traditional capacity design methodologies, developed with the single-class networking paradigm in mind, overlook the non-cooperative structure of modern networks. Consequently, such design approaches entail the danger of degraded performance when resources are added to a network, a phenomenon known as the Braess paradox. The present paper proposes methods for adding resources efficiently to a non-cooperative network of generaltopology. It is shown that the paradox is avoided when resources are added across the network, rather than on a local scale, and when upgrades are focused on direct connections between the sources and destinations. The relevance of these results for modern networks is demonstrated.

[1]  W. Nicholson Intermediate Microeconomics and Its Applications , 1975 .

[2]  Aharon Ben-Tal,et al.  Optimality in Nonlinear Programming: A Feasible Directions Approach. , 1983 .

[3]  A. Nagurney,et al.  ON SOME TRAFFIC EQUILIBRIUM THEORY PARADOXES , 1984 .

[4]  Pradeep Dubey,et al.  Inefficiency of Nash Equilibria , 1986, Math. Oper. Res..

[5]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

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

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

[8]  Roger B. Myerson,et al.  Game theory - Analysis of Conflict , 1991 .

[9]  Christos Douligeris,et al.  Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment , 1992, IEEE Trans. Commun..

[10]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[11]  Eitan Altman,et al.  Flow control using the theory of zero sum Markov games , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

[12]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

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

[14]  Ariel Orda,et al.  Architecting noncooperative networks , 1995, Eighteenth Convention of Electrical and Electronics Engineers in Israel.

[15]  Tad Hogg,et al.  Dilemmas in Computational Societies , 1995, ICMAS.

[16]  Ariel Orda,et al.  Achieving network optima using Stackelberg routing strategies , 1997, TNET.

[17]  F. Kelly,et al.  Braess's paradox in a loss network , 1997, Journal of Applied Probability.

[18]  Ariel Orda,et al.  Capacity allocation under noncooperative routing , 1997, IEEE Trans. Autom. Control..

[19]  Clark Jeffries,et al.  Congestion resulting from increased capacity in single-server queueing networks , 1997, TNET.