IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v30y2019i07ns0129183119400102.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Yu Bai & Ding-Ding Han & Ming Tang, 2019. "Multi-priority routing algorithm based on source node importance in complex networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 30(07), pages 1-13, July.
    • Handle: RePEc:wsi:ijmpcx:v:30:y:2019:i:07:n:s0129183119400102
    DOI: 10.1142/S0129183119400102
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183119400102
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183119400102?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yang, Chao & Chen, Zhuoran & Qian, Jianghai & Han, Dingding & Zhao, Kaidi, 2023. "Simultaneous improvement of multiple transportation performances on link-coupled networks by global dynamic routing," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 616(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijmpcx:v:30:y:2019:i:07:n:s0129183119400102. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.