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

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

Author

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

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.

Suggested Citation

  • Xuan He & Kai Niu & Zhiqiang He & Jiaru Lin & Hui Zhang & Zhong-Yuan Jiang, 2016. "Efficient packet navigation method on scale-free networks with finite and diversiform node delivery capacity," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 27(09), pages 1-11, September.
    • Handle: RePEc:wsi:ijmpcx:v:27:y:2016:i:09:n:s0129183116500984
    DOI: 10.1142/S0129183116500984
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183116500984
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183116500984?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.

    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:27:y:2016:i:09:n:s0129183116500984. 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.