Efficient routing on complex networks

Abstract

In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called {\it efficient path}, which considers the possible congestion in the nodes along actual paths. Since the nodes with largest degree are very susceptible to traffic congestion, an effective way to improve traffic and control congestion, as our new strategy, can be as redistributing traffic load in central nodes to other non-central nodes. Simulation results indicate that the network capability in processing traffic is improved more than 10 times by optimizing the efficient path, which is in good agreement with the analysis.

4 pages, 4 figures

References in corpus (26)

• Emergence of scaling in random networks
• The structure and function of complex networks
• Finding and evaluating community structure in networks
• The architecture of complex weighted networks
• Who is the best connected scientist? A study of scientific coauthorship networks
• Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
• Universal Behavior of Load Distribution in Scale-free Networks
• Organization of Growing Random Networks
• Betweenness Centrality in Large Complex Networks
• Optimal network topologies for local search with congestion
• Weighted evolving networks: coupling topology and weights dynamics
• Network Synchronization, Diffusion, and the Paradox of Heterogeneity
• Communication in networks with hierarchical branching
• Improved routing strategies for Internet traffic delivery
• Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations
• General Dynamics of Topology and Traffic on Weighted Technological Networks
• Vertex overload breakdown in evolving networks
• Accurately modeling the Internet topology
• Edge overload breakdown in evolving networks
• Critical load and congestion instabilities in scale-free networks
• Optimal Paths in Disordered Complex Networks
• Efficient routing on scale-free networks based on local information
• Dynamics of directed graphs: the world-wide Web
• Enhance synchronizability by structural perturbations
• A Mutual Selection Model for Weighted Networks
• Better Synchronizability Predicted by Crossed Double Cycle

Cited by in corpus (95)

• Link Prediction in Complex Networks: A Survey
• Vital nodes identification in complex networks
• Resilience and efficiency in transportation networks
• Control centrality and hierarchical structure in complex networks
• Coevolution spreading in complex networks
• Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity
• Optimal routing on complex networks
• Integrating static and dynamic information for routing traffic
• Congestion phenomena on complex networks
• Communication Bottlenecks in Scale-Free Networks
• A spectrum of routing strategies for brain networks
• Traffic congestion in interconnected complex networks
• A Survey on Centrality Metrics and Their Implications in Network Resilience
• Transport optimization on complex networks
• An adaptive routing strategy for packet delivery in complex networks
• Relations between Average Distance, Heterogeneity and Network Synchronizability
• Stress-induced rearrangements of cellular networks: consequences for protection and drug design
• Discovery of Important Crossroads in Road Network using Massive Taxi Trajectories
• A limited resource model of fault-tolerant capability against cascading failure of complex network
• Efficient routing strategies in scale-free networks with limited bandwidth
• Nature-Inspired Interconnects for Self-Assembled Large-Scale Network-on-Chip Designs
• Mobility and Congestion in Dynamical Multilayer Networks with Finite Storage Capacity
• Efficient routing on multilayered communication networks
• Uncovering missing links with cold ends
• Traffic dynamics in scale-free networks with limited packet-delivering capacity
• Comprehensive routing strategy on multilayer networks
• Collectively optimal routing for congested traffic limited by link capacity
• Congestion diffusion and decongestion strategy in networked traffic
• The Dynamics of Internet Traffic: Self-Similarity, Self-Organization, and Complex Phenomena
• The effect of bandwidth in scale-free network traffic
• Local Empathy provides Global Minimization of Congestion in Communication Networks
• Better synchronizability predicted by a new coupling method
• Geographical networks evolving with optimal policy
• Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality"
• Immunization of traffic-driven epidemic spreading
• Information transport in multiplex networks
• A minimal model for congestion phenomena on complex networks
• Traffic flow in a Manhattan-like urban system
• Quantifying efficient information exchange in real network flows
• Traffic-driven SIR epidemic model on networks
• Predicting missing links via significant paths
• Scaling and memory in recurrence intervals of Internet traffic
• Effect of shortest path multiplicity on congestion of multiplex networks
• Mixing navigation on networks
• Transportation dynamics on coupled networks with limited bandwidth
• Suppressing traffic-driven epidemic spreading by adaptive routing strategy
• Suppressing traffic-driven epidemic spreading by use of the efficient routing protocol
• A Unified Method of Detecting Core-Periphery Structure and Community Structure in Networks
• Jamming transition in traffic flow under the priority queuing protocol
• Optimal transport on wireless networks
• Multiple abrupt phase transitions in urban transport congestion
• Distributed flow optimization and cascading effects in weighted complex networks
• Optimization of transport protocols with path-length constraints in complex networks
• Generalized optimal paths and weight distributions revealed through the large deviations of random walks on networks
• Manipulation of extreme events on scale-free networks
• Scaling behavior of an artificial traffic model on scale-free networks
• The Dynamics of Knowledge Acquisition via Self-Learning in Complex Networks
• Decelerated spreading in degree-correlated networks
• Self Avoiding Paths Routing Algorithm in Scale-Free Networks
• On cost-effective communication network designing
• Multicommodity routing optimization for engineering networks
• The Gradient Mechanism in a Communication Network
• A universal assortativity measure for network analysis
• Optimal transport on supply-demand networks
• Enhancing Transport Efficiency by Hybrid Routing Strategy
• Evolutionary Construction of Geographical Networks with Nearly Optimal Robustness and Efficient Routing Properties
• Optimal forwarding ratio on dynamical networks with heterogeneous mobility
• Preferential Detachment in Broadcast Signaling Networks: Connectivity and Cost Trade-off
• Modeling and Performance Studies of Data Communication Networks using Dynamic Complex Networks
• Emergence of spatial transitions in urban congestion dynamics
• The rigorous solution for the average distance of a Sierpinski network
• Bilevel Optimization for Traffic Mitigation in Optimal Transport Networks
• Efficient priority queueing routing strategy on mobile networks
• Dynamics on Spatial Networks and the Effect of Distance Coarse Graining
• Integrating fluctuations into distribution of resources in transportation networks
• Scalable Node-Disjoint and Edge-Disjoint Multi-wavelength Routing
• Random Walk Access Times on Partially-Disordered Complex Networks: an Effective Medium Theory
• Centralities for Networks with Consumable Resources
• Information transmission on hybrid networks
• Ageing of complex 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
• Traffic dynamics of packets generated with non-homogeneously selected sources and destinations in scale-free networks
• Queue-length synchronization in a communication networks
• Networks and Our Limited Information Horizon
• Ranking the Importance Level of Intermediaries to a Criminal using a Reliance Measure
• Network modules help the identification of key transport routes, signaling pathways in cellular and other networks
• Can Spatiality Promote Diversity?
• Multiple predator based capture process on complex networks
• NC-MOPSO: Network centrality guided multi-objective particle swarm optimization for transport optimization on networks
• A self-organized particle moving model on scale free network with $1/f^2$ behavior
• Traffic properties for stochastic routings on scale-free networks
• Enhancing speed of pinning synchronizability: low-degree nodes with high feedback gains
• Generalized Centrality Aggregation and Exclusive Centrality
• Mean First Hitting Time of Searching for Path Through Random Walks on Complex Networks