Braess's Paradox;
random graphs;
selfish routing;
traffic equilibria;
D O I:
10.1002/rsa.20325
中图分类号:
TP31 [计算机软件];
学科分类号:
081202 ;
0835 ;
摘要:
Braess's Paradox is the counterintuitive fact that removing edges from a network with "selfish routing" can decrease the latency incurred by traffic in an equilibrium flow. We prove that Braess's Paradox is likely to occur in a natural random network model: with high probability, there is a traffic rate and a set of edges whose removal improves the latency of traffic in an equilibrium flow by a constant factor. (C) 2010 Wiley Periodicals, Inc. Random Struct. Alg., 37, 495-515, 2010
机构:
Univ Fed Minas Gerais, Comp Sci Dept, Av Antonio Carlos 6627, BR-31270901 Belo Horizonte, MG, BrazilUniv Fed Minas Gerais, Comp Sci Dept, Av Antonio Carlos 6627, BR-31270901 Belo Horizonte, MG, Brazil
Vieira, Luiz F. M.
Vieira, Marcos A. M.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Fed Minas Gerais, Comp Sci Dept, Av Antonio Carlos 6627, BR-31270901 Belo Horizonte, MG, BrazilUniv Fed Minas Gerais, Comp Sci Dept, Av Antonio Carlos 6627, BR-31270901 Belo Horizonte, MG, Brazil