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

Efficient and robust routing on scale-free networks

Author

Listed:
  • Pu, Cun-Lai
  • Zhou, Si-Yuan
  • Wang, Kai
  • Zhang, Yi-Feng
  • Pei, Wen-Jiang

Abstract

Information routing is one of the most important problems in large communication networks. In this paper we propose a novel routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that incorporates degrees of nodes in paths. Results on large scale-free networks demonstrate that our routing strategy is more efficient than the shortest path algorithm and the efficient routing strategy proposed by Yan et al. [Phys. Rev. E 73, 046108 (2006)]. Furthermore our routing strategy has strong robustness against cascading failure attacks on networks.

Suggested Citation

  • Pu, Cun-Lai & Zhou, Si-Yuan & Wang, Kai & Zhang, Yi-Feng & Pei, Wen-Jiang, 2012. "Efficient and robust routing on scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(3), pages 866-871.
    • Handle: RePEc:eee:phsmap:v:391:y:2012:i:3:p:866-871
    DOI: 10.1016/j.physa.2011.08.044
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437111006728
    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.08.044?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. Lin, Yi & Zhang, Jianwei & Yang, Bo & Liu, Hong & Zhao, Liping, 2019. "An optimal routing strategy for transport networks with minimal transmission cost and high network capacity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 551-561.
    2. Echagüe, Juan & Cholvi, Vicent & Fernández, Antonio, 2022. "Factors affecting congestion-aware routing in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 587(C).
    3. Shen, Yi & Ren, Gang & Liu, Yang, 2016. "Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 229-240.
    4. Chen, Zhenhao & Wu, Jiajing & Rong, Zhihai & Tse, Chi K., 2018. "Optimal topologies for maximizing network transmission capacity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 495(C), pages 191-201.
    5. Wijesundera, Isuri & Halgamuge, Malka N. & Nirmalathas, Ampalavanapillai & Nanayakkara, Thrishantha, 2016. "MFPT calculation for random walks in inhomogeneous networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 462(C), pages 986-1002.
    6. 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).
    7. Jin, Wei-Xin & Song, Ping & Liu, Guo-Zhu & Stanley, H. Eugene, 2015. "The cascading vulnerability of the directed and weighted network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 427(C), pages 302-325.

    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:391:y:2012:i:3:p:866-871. 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.