An adaptive routing strategy for packet delivery in complex networks

Abstract

We present an efficient routing approach for delivering packets in complex networks. On delivering a message from a node to a destination, a node forwards the message to a neighbor by estimating the waiting time along the shortest path from each of its neighbors to the destination. This projected waiting time is dynamical in nature and the path through which a message is delivered would be adapted to the distribution of messages in the network. Implementing the approach on scale-free networks, we show that the present approach performs better than the shortest-path approach and another approach that takes into account of the waiting time only at the neighboring nodes. Key features in numerical results are explained by a mean field theory. The approach has the merit that messages are distributed among the nodes according to the capabilities of the nodes in handling messages.

6 pages, 4 figures

References in corpus (20)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Assortative mixing in networks
• Statistical Physics of Vehicular Traffic and Some Related Systems
• Mean-field theory for scale-free random networks
• Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
• Universal Behavior of Load Distribution in Scale-free Networks
• Connectivity of Growing Random Networks
• Cascade control and defense in complex networks
• Generation of uncorrelated random scale-free networks
• Efficient routing on complex networks
• Optimal network topologies for local search with congestion
• Communication in networks with hierarchical branching
• Improved routing strategies for Internet traffic delivery
• Dynamics of jamming transitions in complex networks
• Critical load and congestion instabilities in scale-free networks
• Dynamical properties of model communication networks
• Coexistence of regular and irregular dynamics in complex networks of pulse-coupled oscillators
• Performance of data networks with random links
• An efficient approach of controlling traffic congestion in scale-free networks

Cited by in corpus (13)

• Critical phenomena in complex networks
• 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
• Effect of shortest path multiplicity on congestion of multiplex networks
• Mechanism of organization increase in complex systems
• Exponential Self-Organization and Moore's Law: Measures and Mechanisms
• Optimal forwarding ratio on dynamical networks with heterogeneous mobility
• The effect of network structure on phase transitions in queuing networks
• Self-Adjusting Networks to Minimize Expected Path Length
• Model Identification of a Network as Compressing Sensing
• An effective local routing strategy on the BA network
• A Reconstruction algorithm for an unknown network