Optimal routing on complex networks

TL;DR

This paper introduces a heuristic routing algorithm for complex networks that balances traffic by minimizing maximum node betweenness, enabling higher traffic capacity without increasing path lengths, thus preventing network jamming.

Contribution

The paper proposes a new heuristic algorithm that optimizes routing by balancing load and reducing overload, improving network capacity over traditional shortest path methods.

Findings

Network can sustain higher traffic without jamming.

Routing table effectively balances traffic load.

Algorithm outperforms traditional shortest path routing.

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.