Optimal transport on complex networks

Bogdan Danila, Yong Yu, John A. Marsh, Kevin E. Bassler
2006 Physical Review E  
We present a novel heuristic algorithm for routing optimization on complex networks. Previously proposed routing 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 queuing overload. By using the resulting routing table, a network can sustain significantly higher traffic without jamming than
more » ... ithout jamming than in the case of traditional shortest path routing.
doi:10.1103/physreve.74.046106 pmid:17155132 fatcat:umxus27ntzfmvh2enbtjzscetu