Optimal routing on complex networks

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Statistical Mechanics, Disordered Systems and Neural Networks, Networking and Internet Architecture

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/133373

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cond-mat/0607017
 http://arxiv.org/abs/cond-mat/0607017
 Phys Rev E 74, 046106 (2006)
 doi:10.1103/PhysRevE.74.046106

Collections

arXiv