Multi-priority routing algorithm based on source node importance in complex networks

Yu Bai, Ding-Ding Han and Ming Tang
Additional contact information
Yu Bai: School of Information Science and Technology, Fudan University, Shanghai 200433, P. R. China†School of Information Science and Technology, East China Normal University, Shanghai 200241, P. R. China
Ding-Ding Han: School of Information Science and Technology, Fudan University, Shanghai 200433, P. R. China†School of Information Science and Technology, East China Normal University, Shanghai 200241, P. R. China
Ming Tang: #x2020;School of Information Science and Technology, East China Normal University, Shanghai 200241, P. R. China

International Journal of Modern Physics C (IJMPC), 2019, vol. 30, issue 07, 1-13

Abstract: Network transmission capacity is an important guarantee for the normal operation of the network. The effective routing strategy avoids the use of nodes with large degree value, which leads to low utilization of nodes and failure to consider the priorities of different packets. On this basis, a routing algorithm based on packet source node classification is proposed. This strategy introduces an adjustable parameter. By adjusting this parameter, the data packets generated at the important nodes are transferred to the nodes with higher degree, which is to say they can reach the destination faster. The data packets generated at the sub-important nodes are transmitted by nodes with smaller degrees, thus reaching the destination relatively slowly. The routing strategy is evaluated in terms of order parameters, average routing time and node utilization. Compared with nonclassified routing and randomly classified routing strategy, the network transmission capacity was increased by 19% and 38%, respectively. Each node in the network was used more evenly. At the same time, the network transmission capacity under different parameters is analyzed theoretically through a series of derivations. In order to explore the performance of routing strategy in actual networks, this paper selects the actual network of web-EPA for simulation. The experimental results show that the proposed routing strategy is 7% and 17% higher than the nonclassified routing and random classified routing, respectively.

Keywords: Classified routing; congestion; node utilization; transmission capability (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183119400102
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:30:y:2019:i:07:n:s0129183119400102

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183119400102

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 ().