Skip to main content
×
×
Home

Avoiding the Braess paradox in non-cooperative networks

  • Yannis A. Korilis (a1), Aurel A. Lazar (a2) and Ariel Orda (a3)
Abstract

The exponential growth 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 general topology. 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.

Copyright
Corresponding author
Postal address: Bell Laboratories, Lucent Technologies, Holmdel, NJ 07733, USA.
∗∗ Postal address: Department of Electrical Engineering, Columbia University, New York, NY 10027, USA.
∗∗∗ Postal address: Department of Electrical Engineering, Technion, Haifa 32000, Israel. Email address: ariel@ee.technion.ac.il
References
Hide All
[1] Altman, E. (1994). Flow control using the theory of Zero-Sum Markov games. IEEE Trans. Automatic Control 39, 814818.
[2] Bean, N. G., Kelly, F. P., and Taylor, P. G. (1997). Braess' paradox in a loss network. J. Appl. Prob. 34, 155159.
[3] Ben-Israel, A., Ben-Tal, A., and Zlobec, S. (1981). Optimality in Nonlinear Programming: a Feasible Directions Approach. Wiley, New York.
[4] Bertsekas, D., and Gallager, R. (1992). Data Networks, 2nd edn. Prentice-Hall, Englewood Cliffs, NJ.
[5] Cohen, J. E., and Kelly, F. P. (1990). A paradox of congestion in a queuing network. J. Appl. Prob. 27, 730734.
[6] Cohen, J. E., and Horwitz, P. (1991). Paradoxical behaviour of mechanical and electrical networks. Nature 352, 699701.
[7] Cohen, J. E., and Jeffries, C. (1997). Congestion resulting from increased capacity in single-server queueing networks. IEEE/ACM Trans. Networking 5, 305310.
[8] Dafermos, S., and Nagurney, A. (1984). On some traffic equilibrium theory paradoxes. Transportation Research B 18, 101110.
[9] Dubey, P. (1986). Inefficiency of Nash equilibria. Math. Operat. Res. 11, 18.
[10] Glance, N. S., and Hogg, T. (1995). Dilemmas in computational societies. In Proc. 1st International Conference on Multiagent Systems, San Francisco, CA, June 1995, pp. 117124.
[11] Irvine, A. D. (1993). How Braess' paradox solves Newcomb's problem. Internat. Stud. Philos. Sci. 7, 141160.
[12] Korilis, Y. A., Lazar, A. A., and Orda, A. (1995). Architecting non-cooperative networks. IEEE J. Sel. Areas Commun. 13, 12411251.
[13] Korilis, Y. A., Lazar, A. A., and Orda, A. (1997). Achieving network optima using Stackelberg routing strategies. IEEE/ACM Trans. Networking 5, 161173.
[14] Korilis, Y. A., Lazar, A. A., and Orda, A. (1997). Capacity allocation under non-cooperative routing. IEEE Trans. Automatic Control 42, 309325.
[15] Luenberger, D. G. (1984). Linear and Nonlinear Programming, 2nd edn. Addison Wesley, Reading, MA.
[16] Myerson, R. B. (1991). Game Theory: Analysis of Conflict. Harvard University Press, Cambridge, MA.
[17] Nicholson, W. (1994). Intermediate Microeconomics and its Applications, 6th edn. Dryden Press, Fort Worth, TX.
[18] Orda, A., Rom, R., and Shimkin, N. (1993). Competitive routing in multiuser communication networks. IEEE/ACM Trans. Networking 1, 510521.
[19] Zhang, Z., and Douligeris, C. (1992). Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment. IEEE Trans. Commun. 40, 12771281.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Applied Probability
  • ISSN: 0021-9002
  • EISSN: 1475-6072
  • URL: /core/journals/journal-of-applied-probability
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

MSC classification

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed