Efficient routing on scale-free networks based on local information
From MaRDI portal
Publication:973499
DOI10.1016/j.physleta.2005.10.104zbMath1234.68026arXivphysics/0506204MaRDI 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
68M10: Network design and communication in computer systems
Related Items
SEARCHING EFFICIENCY ON COMPLEX NETWORKS UNDER VISUAL RANGE OF NODES, The self-adaptive routing strategy to alleviate packet loss in finite buffer networks, EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS, Bandwidth allocation strategy for traffic systems of scale-free network, A local-world node deleting evolving network model, Effective usage of shortest paths promotes transportation efficiency on scale-free networks, Upper bound of network capacity and a static optimal packet routing strategy, Traffic dynamics on complex networks: a survey, Self avoiding paths routing algorithm in scale-free networks, Combined trust model based on evidence theory in iterated prisoner's dilemma game, A minimal model for congestion phenomena on complex networks, PROPERTIES OF AN EVOLVING DIRECTED NETWORK WITH LOCAL RULES AND INTRINSIC VARIABLES, DYNAMICS OF ROUTING MECHANISMS ON TRAFFIC NETWORKS, TRAFFIC CONGESTION ANALYSIS IN COMPLEX NETWORKS BASED ON VARIOUS ROUTING STRATEGIES
Cites Work
