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 (7)

• Who is the best connected scientist? A study of scientific coauthorship networks
• Efficient routing on complex networks
• Optimal network topologies for local search with congestion
• Optimization with Extremal Dynamics
• Improved routing strategies for Internet traffic delivery
• Dynamics of jamming transitions in complex networks
• Effect of congestion costs on shortest paths through complex networks

Cited by in corpus (44)

• The Large Scale Curvature of Networks
• Traffic congestion in interconnected complex networks
• Improved community structure detection using a modified fine tuning strategy
• Transport optimization on complex networks
• Efficient routing strategies in scale-free networks with limited bandwidth
• 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
• Mobility and Congestion in Dynamical Multilayer Networks with Finite Storage Capacity
• A model to identify urban traffic congestion hotspots in complex networks
• Collectively optimal routing for congested traffic limited by link capacity
• Comprehensive routing strategy on multilayer networks
• Transportation dynamics on networks of mobile agents
• Congestion diffusion and decongestion strategy in networked traffic
• Local Empathy provides Global Minimization of Congestion in Communication Networks
• The Competition for Shortest Paths on Sparse Graphs
• Decongestion of urban areas with hotspot-pricing
• Information transport in multiplex networks
• Transportation dynamics on coupled networks with limited bandwidth
• Jamming transition in traffic flow under the priority queuing protocol
• Optimal transport on wireless networks
• Optimization of transport protocols with path-length constraints in complex networks
• Distributed flow optimization and cascading effects in weighted complex networks
• Controlling congestion on complex networks: fairness, efficiency and network structure
• The Dynamics of Knowledge Acquisition via Self-Learning in Complex Networks
• Self Avoiding Paths Routing Algorithm in Scale-Free Networks
• Fair Throughput Optimization with a Dynamic Network of Drone Relays
• On cost-effective communication network designing
• Optimal transport on supply-demand networks
• Fair sharing of resources in a supply network with constraints
• Integrating fluctuations into distribution of resources in transportation networks
• Micro-interventions in urban transport from pattern discovery on the flow of passengers and on the bus network
• Efficient priority queueing routing strategy on mobile networks
• A minimalist model for co-evolving supply and drainage networks
• A link model approach to identify congestion hotspots
• Information transmission on hybrid networks
• Study of dynamic and static routing for improvement of the transportation efficiency on small complex networks
• Link power coordination for energy conservation in complex communication networks
• Limits on Relief through Constrained Exchange on Random Graphs
• Malleability of complex networks
• Local search on protein residue networks
• Enhancing network transmission capacity by efficiently allocating node capability
• A scientific understanding of network designing
• Mean First Hitting Time of Searching for Path Through Random Walks on Complex Networks