On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms
Journal of the ACM (JACM)
Edge-Disjoint Paths in Expander Graphs
SIAM Journal on Computing
Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Short paths in expander graphs
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A stronger bound on Braess's Paradox
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On certain connectivity properties of the internet topology
Journal of Computer and System Sciences - Special issue on FOCS 2003
On the severity of Braess's paradox: designing networks for selfish users is hard
Journal of Computer and System Sciences - Special issue on FOCS 2001
On a Paradox of Traffic Planning
Transportation Science
Efficient Methods for Selfish Network Design
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Braess's Paradox in large random graphs
Random Structures & Algorithms
Braess's paradox in large sparse graphs
WINE'10 Proceedings of the 6th international conference on Internet and network economics
| Hi-index | 0.00 |
Expander graphs are known to facilitate effective routing and most real-world networks have expansion properties. At the other extreme, it has been shown that in some special graphs, removing certain edges can lead to moreefficient routing. This phenomenon is known as Braess's paradox and is usually regarded as a rare event. In contrast to what one might expect, we show that Braess's paradox is ubiquitous in expander graphs. Specifically, we prove that Braess's paradox occurs in a large class of expander graphs with continuous convex latency functions. Our results extend previous work which held only when the graph was both denser and random and for random linear latency functions. We identify deterministic sufficient conditions for a graph with as few as a linear number of edges, such that Braess's Paradox almost always occurs, with respect to a general family of random latency functions. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012 © 2012 Wiley Periodicals, Inc.