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

Probability routing strategy for scale-free networks

Author

Listed:
  • Zhang, Xiaojun
  • He, Zishu
  • He, Zheng
  • Rayman-Bacchus, Lez

Abstract

This study proposes a probability routing strategy for improving traffic capability on scale-free networks. Compared with the shortest path routing strategy depending on central nodes largely and the efficient routing strategy avoiding hub routers as much as possible, the probability routing strategy makes use of hub routers more efficiently, transferring approximate average amount of packs of the whole network. Simulation results indicate that the probability routing strategy has the highest network capacity among the three routing strategies. This strategy provides network capacity that can be more than 30 times higher than that of the shortest path routing strategy and over 50% higher than that of the efficient routing strategy. In addition, the average routing path length of our proposed strategy is over 10% shorter than that of the efficient routing strategy and only about 10% longer than that of the shortest path routing strategy.

Suggested Citation

  • Zhang, Xiaojun & He, Zishu & He, Zheng & Rayman-Bacchus, Lez, 2013. "Probability routing strategy for scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(4), pages 953-958.
  • Handle: RePEc:eee:phsmap:v:392:y:2013:i:4:p:953-958 DOI: 10.1016/j.physa.2012.10.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437112008928
    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

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

    References listed on IDEAS

    as
    1. Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 1999. "Mean-field theory for scale-free random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 272(1), pages 173-187.
    2. Abe, Sumiyoshi & Suzuki, Norikazu, 2005. "Scale-free statistics of time interval between successive earthquakes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 350(2), pages 588-596.
    3. Abe, Sumiyoshi & Pastén, Denisse & Suzuki, Norikazu, 2011. "Finite data-size scaling of clustering in earthquake networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(7), pages 1343-1349.
    4. Barabási, Albert-László & Ravasz, Erzsébet & Vicsek, Tamás, 2001. "Deterministic scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 299(3), pages 559-564.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Paul, Jomon Aliyas & MacDonald, Leo, 2016. "Location and capacity allocations decisions to mitigate the impacts of unexpected disasters," European Journal of Operational Research, Elsevier, vol. 251(1), pages 252-263.
    2. Paul, Jomon Aliyas & MacDonald, Leo, 2016. "Optimal location, capacity and timing of stockpiles for improved hurricane preparedness," International Journal of Production Economics, Elsevier, vol. 174(C), pages 11-28.

    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:392:y:2013:i:4:p:953-958. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

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

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.