Optimal transport on complex networks.
We present a heuristic algorithm for the optimization of transport on complex networks. Previously proposed network transport optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing the maximum node betweenness with as little path lengthening as possible, thus being useful in cases when networks are jamming due to node congestion. By using the resulting routing, a network can sustain significantly higher traffic without jamming than in the case of shortest path routing.
Danila
Bogdan
B
Department of Physics, The University of Houston, Houston, Texas 77004, USA. dbogdan@mail.uh.edu
Yu
Yong
Y
Marsh
John A
JA
Bassler
Kevin E
KE