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.
No takes yet. Share an insight, caveat, or question.
Danila et al. (2006) studied this question.