Integrating static and dynamic information for routing traffic

Abstract

The efficiency of traffic routing on complex networks can be reflected by two key measurements i.e. the system capacity and the average data packets travel time. In this paper, we propose a mixing routing strategy by integrating local static and dynamic information for enhancing the efficiency of traffic on scale-free networks. The strategy is governed by a single parameter. Simulation results show that there exists a optimal parameter value by considering both maximizing the network capacity and reducing the packet travel time. Comparing with the strategy by adopting exclusive local static information, the new strategy shows its advantages in improving the efficiency of the system. The detailed analysis of the mixing strategy is provided. This work suggests that how to effectively utilize the larger degree nodes plays the key role in the scale-free traffic systems.

5 pages, 5 figures

References in corpus (21)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Dynamical and correlation properties of the Internet
• Efficient routing on complex networks
• Optimal network topologies for local search with congestion
• Weighted evolving networks: coupling topology and weights dynamics
• Communication in networks with hierarchical branching
• Fluctuations in network dynamics
• Improved routing strategies for Internet traffic delivery
• Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations
• Sandpile on Scale-Free Networks
• General Dynamics of Topology and Traffic on Weighted Technological Networks
• Vertex overload breakdown in evolving networks
• Dynamical properties of model communication networks
• Path finding strategies in scale-free networks
• Separating internal and external dynamics of complex systems
• Information Super-Diffusion on Structured Networks
• Robustness of the avalanche dynamics in data packet transport on scale-free networks
• Effect of congestion costs on shortest paths through complex networks
• Congestion and decongestion in a communication network
• Phase transition in a directed traffic flow network

Cited by in corpus (28)

• Traffic congestion in interconnected complex networks
• Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
• Efficient routing strategies in scale-free networks with limited bandwidth
• Traffic dynamics in scale-free networks with limited packet-delivering capacity
• Transportation dynamics on networks of mobile agents
• 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
• Immunization of traffic-driven epidemic spreading
• Information transport in multiplex networks
• Preferential Behaviour and Scaling in Diffusive Dynamics on Networks
• A complex network analysis of hypertension-related genes
• Enhancing Transport Efficiency by Hybrid Routing Strategy
• Traffic-driven epidemic spreading on scale-free networks with tunable degree distribution
• Integrating fluctuations into distribution of resources in transportation networks
• Efficient priority queueing routing strategy on mobile networks
• Information transmission on hybrid networks
• Theoretical approach and impact of correlations on the critical packet generation rate in traffic dynamics on complex networks
• Study of dynamic and static routing for improvement of the transportation efficiency on small complex networks
• Traffic dynamics of packets generated with non-homogeneously selected sources and destinations in scale-free networks
• Queue-length synchronization in a communication networks
• A pathway-based network analysis of hypertension-related genes
• An effective local routing strategy on the BA network
• Random walk with priorities in communication-like networks
• Traffic properties for stochastic routings on scale-free networks
• Mean First Hitting Time of Searching for Path Through Random Walks on Complex Networks
• Adaptive Fractal-like Network Structure for Efficient Search of Inhomogeneously Distributed Targets at Unknown Positions
• Bufferless transmission in complex networks