Optimal routing on complex networks
Bogdan Danila, Yong Yu, John A. Marsh, Kevin E. Bassler
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.
Create a lesson
Related papers
Chemical potentials from structure factors: II. Charged multi-component mixtures
Xiaoyu Wang, Roya Savoj, Musahid Ahmed et al.
Asymmetry-controlled resonant transport in a Brownian flashing ratchet
Sudipta Mandal, Dipanjan Chakraborty, Debasish Chaudhuri
Branching stochastic mechanics. I. Clustering and connected correlations within a branching-process representation of the Schrödinger equation
Eric Dumonteil, Benoît Bischoff, Alain Letourneau et al.
Representation Transitions Reveal Predictive Structure in Complex Systems: A Trajectory-Level Reconstruction in a Critical System
Jiaqi Pan
Phase Diagram and Critical Behaviour of the Two-Dimensional Potts Model with Long-Range Quenched Disorder
Rodolfo Rocha, Leticia F. Cugliandolo, Marco Picco
Ornstein-Uhlenbeck Process Driven by Multiple Dichotomous Noises
Silvio Kalaj, Dongho Lee, Enzo Marinari et al.