An adaptive routing strategy for packet delivery in complex networks

DOI10.1016/J.PHYSLETA.2006.12.009zbMATH Open1203.90036arXiv0806.1843OpenAlexW2048843578MaRDI QIDQ620799FDOQ620799

Authors: Huan Zhang, Ming Tang, P. M. Hui, Zonghua Liu 

Publication date: 20 January 2011

Published in: Physics Letters. A (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0806.1843

Recommendations

• A LOCAL INFORMATION-BASED ROUTING STRATEGY ON THE SCALE-FREE NETWORK
• Efficient routing on scale-free networks based on local information
• Improved efficient routing strategy on scale-free networks
• Efficient delay routing
• EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)

Cites Work

• Statistical mechanics of complex networks
• Complex networks: structure and dynamics
• Emergence of Scaling in Random Networks
• Metric structure of random networks
• Self-organized critical traffic in parallel computer networks

Cited In (19)

• How the contagion at links influences epidemic spreading
• Exponential self-organization and Moore's law: measures and mechanisms
• Dealing with network complexity in real-time networked control
• Robustness analysis of static routing on networks
• Adaptive routing with stale information
• Title not available (Why is that?)
• Abstract geometrical computation. IV: Small Turing universal signal machines
• Risks of an epidemic in a two-layered railway-local area traveling network
• Traffic dynamics on complex networks: a survey
• Title not available (Why is that?)
• Model identification of a network as compressing sensing
• Optimal forwarding ratio on dynamical networks with heterogeneous mobility
• Efficient routing strategy with transmission history information and its surrogate analysis
• An optimal adaptive routing algorithm
• A hybrid routing model for mitigating congestion in networks
• Self-adjusting grid networks to minimize expected path length
• Adaptive routing with stale information
• Failure risk propagation and protection schemes in coupled systems
• Self-adjusting grid networks to minimize expected path length

This page was built for publication: An adaptive routing strategy for packet delivery in complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q620799)