Optimal routing on complex networks

Abstract

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 in the case of traditional shortest path routing.

4 pages, 5 figures

References in corpus (2)

• Efficient routing on complex networks
• Dynamics of jamming transitions in complex networks

Cited by in corpus (9)

• Transport optimization on complex networks
• Synchronization in Weighted Uncorrelated Complex Networks in a Noisy Environment: Optimization and Connections with Transport Efficiency
• Nature-Inspired Interconnects for Self-Assembled Large-Scale Network-on-Chip Designs
• Impact of community structure on information transfer
• Congestion diffusion and decongestion strategy in networked traffic
• Optimal transport on wireless networks
• Limits on Relief through Constrained Exchange on Random Graphs
• Enhancing network transmission capacity by efficiently allocating node capability
• A scientific understanding of network designing