Efficient packet navigation method on scale-free networks with finite and diversiform node delivery capacity

Xuan He, Kai Niu, Zhiqiang He, Jiaru Lin, Hui Zhang () and Zhong-Yuan Jiang ()
Additional contact information
Xuan He: Key Laboratory of Universal Wireless Communications, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China†China Unicom Broadband Online Limited Corporation, Beijing 100031, China
Kai Niu: Key Laboratory of Universal Wireless Communications, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
Zhiqiang He: Key Laboratory of Universal Wireless Communications, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
Jiaru Lin: Key Laboratory of Universal Wireless Communications, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
Hui Zhang: Department of Information Engineering, Yulin University, Yulin, Shaanxi 719000, China
Zhong-Yuan Jiang: School of Cyber Engineering, Xidian University, Xi’an, Shaanxi 710071, China

International Journal of Modern Physics C (IJMPC), 2016, vol. 27, issue 09, 1-11

Abstract: Routing strategy is essential for high transport efficiency on realistic networked complex systems. Beginning from the consideration of finite and diversiform node delivery capacity distributions, a general node capacity allocation mechanism with a tunable parameter α is presented. A node capacity, based routing strategy is proposed to improve the network traffic capacity. Compared with the traditional shortest path routing (SPR) and the efficient routing (ER) methods, it suggests that routing strategy should be chosen heuristically according to the limited capacity resource distribution, instead of using one certain method for all cases. With proper range of parameter α, the new routing strategy achieves the highest traffic capacity and other preferable measure metrics including network diameter, average path length, efficient betweenness, average packet travel time and average traffic load. The theoretical analysis for traffic capacity has a good correspondence to the simulation results. This work studies routing mechanisms from a very practical perspective, and helps network researchers to understand the traffic dynamics on complex networks comprehensively.

Keywords: Complex network; scale-free network; efficient routing; traffic capacity; delivery capacity distribution (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183116500984
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:27:y:2016:i:09:n:s0129183116500984

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183116500984

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().