Efficient routing on scale-free networks based on local information

DOI10.1016/J.PHYSLETA.2005.10.104zbMATH Open1234.68026arXivphysics/0506204OpenAlexW2113740394MaRDI QIDQ973499FDOQ973499

Authors: Chuan-Yang Yin, Bing-Hong Wang, Wen-Xu Wang, Tao Zhou, Huijie Yang 

Publication date: 2 June 2010

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

Abstract: In this letter, we propose a new routing strategy with a single free parameter $alpha$ only based on local information of network topology. In order to maximize the packets handling capacity of underlying structure that can be measured by the critical point of continuous phase transition from free flow to congestion, the optimal value of $alpha$ is sought out. By investigating the distributions of queue length on each node in free state, we give an explanation why the delivering capacity of the network can be enhanced by choosing the optimal $alpha$. Furthermore, dynamic properties right after the critical point are also studied. Interestingly, it is found that although the system enters the congestion state, it still possesses partial delivering capability which do not depend on $alpha$. This phenomenon suggests that the capacity of the network can be enhanced by increasing the forwarding ability of small important nodes which bear severe congestion.

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

Recommendations

• A LOCAL INFORMATION-BASED ROUTING STRATEGY ON THE SCALE-FREE NETWORK
• EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS
• Dynamic routing algorithm based on local information in a free-scale network
• Improved efficient routing strategy on scale-free networks
• Self avoiding paths routing algorithm in scale-free networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Collective dynamics of ‘small-world’ networks

Cited In (20)

• A global routing method for weighted scale-free networks
• Effective usage of shortest paths promotes transportation efficiency on scale-free networks
• A LOCAL INFORMATION-BASED ROUTING STRATEGY ON THE SCALE-FREE NETWORK
• Bandwidth allocation strategy for traffic systems of scale-free network
• A local-world node deleting evolving network model
• TRAFFIC CONGESTION ANALYSIS IN COMPLEX NETWORKS BASED ON VARIOUS ROUTING STRATEGIES
• On the critical packet injection rate of a preferential next-nearest neighbor routing traffic model on Barabási-Albert networks
• Upper bound of network capacity and a static optimal packet routing strategy
• SEARCHING EFFICIENCY ON COMPLEX NETWORKS UNDER VISUAL RANGE OF NODES
• The self-adaptive routing strategy to alleviate packet loss in finite buffer networks
• Enhancing traffic capacity for scale-free networks by the one-way links
• Self avoiding paths routing algorithm in scale-free networks
• Traffic dynamics on complex networks: a survey
• Optimal forwarding ratio on dynamical networks with heterogeneous mobility
• A minimal model for congestion phenomena on complex networks
• EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS
• Combined trust model based on evidence theory in iterated prisoner's dilemma game
• DYNAMICS OF ROUTING MECHANISMS ON TRAFFIC NETWORKS
• An adaptive routing strategy for packet delivery in complex networks
• PROPERTIES OF AN EVOLVING DIRECTED NETWORK WITH LOCAL RULES AND INTRINSIC VARIABLES

This page was built for publication: Efficient routing on scale-free networks based on local information

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