Efficient routing on scale-free networks based on local information

DOI10.1016/J.PHYSLETA.2005.10.104zbMath1234.68026arXivphysics/0506204OpenAlexW2113740394MaRDI QIDQ973499

Hui-Jie Yang, Bing-Hong Wang, Tao Zhou, Chuan-Yang Yin, Wen-Xu Wang

Publication date: 2 June 2010

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

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (14)

EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS ⋮ Effective usage of shortest paths promotes transportation efficiency on scale-free networks ⋮ Self avoiding paths routing algorithm in scale-free networks ⋮ DYNAMICS OF ROUTING MECHANISMS ON TRAFFIC NETWORKS ⋮ TRAFFIC CONGESTION ANALYSIS IN COMPLEX NETWORKS BASED ON VARIOUS ROUTING STRATEGIES ⋮ Bandwidth allocation strategy for traffic systems of scale-free network ⋮ Traffic dynamics on complex networks: a survey ⋮ A minimal model for congestion phenomena on complex networks ⋮ SEARCHING EFFICIENCY ON COMPLEX NETWORKS UNDER VISUAL RANGE OF NODES ⋮ A local-world node deleting evolving network model ⋮ Upper bound of network capacity and a static optimal packet routing strategy ⋮ Combined trust model based on evidence theory in iterated prisoner's dilemma game ⋮ PROPERTIES OF AN EVOLVING DIRECTED NETWORK WITH LOCAL RULES AND INTRINSIC VARIABLES ⋮ The self-adaptive routing strategy to alleviate packet loss in finite buffer networks

Cites Work

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

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