Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T09:58:15.788Z Has data issue: false hasContentIssue false

Avoiding the Braess paradox in non-cooperative networks

Published online by Cambridge University Press:  14 July 2016

Yannis A. Korilis*
Affiliation:
Lucent Technologies
Aurel A. Lazar*
Affiliation:
Columbia University
Ariel Orda*
Affiliation:
Technion
*
∗ 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

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.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1999 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable