IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v390y2011i13p2593-2600.html
   My bibliography  Save this article

Optimal routing strategy based on the minimum information path

Author

Listed:
  • Wang, Kai
  • Zhang, Yifeng
  • Zhou, Siyuan
  • Pei, Wenjiang
  • Wang, Shaoping
  • Li, Tao

Abstract

In this paper, we propose a new routing strategy based on the minimum information path, named the optimal routing (OR) strategy, to improve the transportation capacity of scale-free networks. We define the average routing centrality degree of the node to analyze the traffic load on nodes of different degree. We analyze the transportation capacity by using the critical values of Rc, the average packet travel time, and the average path length. Both theoretical and experimental results show that the capacity of the network under our strategy will be maximized when the packet-delivery rate of the node is directly proportional to the degree.

Suggested Citation

  • Wang, Kai & Zhang, Yifeng & Zhou, Siyuan & Pei, Wenjiang & Wang, Shaoping & Li, Tao, 2011. "Optimal routing strategy based on the minimum information path," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(13), pages 2593-2600.
    • Handle: RePEc:eee:phsmap:v:390:y:2011:i:13:p:2593-2600
    DOI: 10.1016/j.physa.2011.01.026
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437111000902
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2011.01.026?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. He, Kun & Xu, Zhongzhi & Wang, Pu, 2015. "A hybrid routing model for mitigating congestion in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 431(C), pages 1-17.
    2. Gong, Hang & He, Kun & Qu, Yingchun & Wang, Pu, 2016. "Analysis and improvement of vehicle information sharing networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 106-112.
    3. Xi Zhang & Zhili Zhou & Dong Cheng, 2017. "Efficient path routing strategy for flows with multiple priorities on scale-free networks," PLOS ONE, Public Library of Science, vol. 12(2), pages 1-16, February.
    4. Zhang, Junfeng & Ma, Jinlong & Li, Hui-Jia, 2022. "An efficient link closing strategy for improving traffic capacity on scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 604(C).
    5. Ma, Jinlong & Kong, Lingkang & Li, Hui-Jia, 2023. "An effective edge-adding strategy for enhancing network traffic capacity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(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:eee:phsmap:v:390:y:2011:i:13:p:2593-2600. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.