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

Effective usage of shortest paths promotes transportation efficiency on scale-free networks

Author

Listed:
  • Du, Wen-Bo
  • Wu, Zhi-Xi
  • Cai, Kai-Quan

Abstract

With rapid economic and social development, the problem of traffic congestion is getting more and more serious. Accordingly, network traffic models have attracted extensive attention. In this paper, we introduce a shortest-remaining-path-first queuing strategy into a network traffic model on Barabási–Albert scale-free networks under efficient routing protocol, where one packet’s delivery priority is related to its current distance to the destination. Compared with the traditional first-in-first-out queuing strategy, although the network capacity has no evident changes, some other indexes reflecting transportation efficiency are significantly improved in the congestion state. Extensive simulation results and discussions are carried out to explain the phenomena. Our work may be helpful for the designing of optimal networked-traffic systems.

Suggested Citation

  • Du, Wen-Bo & Wu, Zhi-Xi & Cai, Kai-Quan, 2013. "Effective usage of shortest paths promotes transportation efficiency on scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(17), pages 3505-3512.
    • Handle: RePEc:eee:phsmap:v:392:y:2013:i:17:p:3505-3512
    DOI: 10.1016/j.physa.2013.03.032
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437113002653
    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.2013.03.032?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. Zhongzhi Xu & Li Sun & Junjie Wang & Pu Wang, 2014. "The Loss of Efficiency Caused by Agents’ Uncoordinated Routing in Transport Networks," PLOS ONE, Public Library of Science, vol. 9(10), pages 1-11, October.
    2. 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.
    3. Sun, Li & Liu, Like & Xu, Zhongzhi & Jie, Yang & Wei, Dong & Wang, Pu, 2015. "Locating inefficient links in a large-scale transportation network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 537-545.
    4. Yuchen Pan & Shuai Ding & Wenjuan Fan & Jing Li & Shanlin Yang, 2015. "Trust-Enhanced Cloud Service Selection Model Based on QoS Analysis," PLOS ONE, Public Library of Science, vol. 10(11), pages 1-19, November.
    5. Rong, Lei & Liu, Jing, 2018. "A heuristic algorithm for enhancing the robustness of scale-free networks based on edge classification," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 503-515.
    6. Zhu, Kai & Ji, Kaiyuan & Shen, Jiayu, 2021. "A fixed charge transportation problem with damageable items under uncertain environment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 581(C).
    7. Gao, Cai & Yan, Chao & Zhang, Zili & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2014. "An amoeboid algorithm for solving linear transportation problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 398(C), pages 179-186.
    8. Wang, Zhen & Yu, Chao & Cui, Guang-Hai & Li, Ya-Peng & Li, Ming-Chu, 2016. "Evolution of cooperation in spatial iterated Prisoner’s Dilemma games under localized extremal dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 566-575.
    9. Lordan, Oriol & Sallan, Jose M. & Escorihuela, Nuria & Gonzalez-Prieto, David, 2016. "Robustness of airline route networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 445(C), pages 18-26.
    10. Xiao, Guanping & Zheng, Zheng & Wang, Haoqin, 2017. "Evolution of Linux operating system network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 466(C), pages 249-258.
    11. Wu, Chao-Yun & Li, Ming & Jiang, Rui & Hao, Qing-Yi & Hu, Mao-Bin, 2018. "Perimeter control for urban traffic system based on macroscopic fundamental diagram," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 231-242.
    12. Zhang, Wenping & Xia, Yongxiang & Ouyang, Bo & Jiang, Lurong, 2015. "Effect of network size on robustness of interconnected networks under targeted attack," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 435(C), pages 80-88.
    13. Chen, Jie & Wu, Chao-Yun & Li, Ming & Hu, Mao-Bin, 2019. "Hybrid traffic dynamics on coupled networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 98-104.
    14. Wen, Tzai-Hung & Chin, Wei-Chien-Benny & Lai, Pei-Chun, 2017. "Understanding the topological characteristics and flow complexity of urban traffic congestion," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 473(C), pages 166-177.
    15. Yang, Zhirou & Liu, Jing, 2018. "A memetic algorithm for determining the nodal attacks with minimum cost on complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 1041-1053.
    16. Wang, Haoqin & Chen, Zhen & Xiao, Guanping & Zheng, Zheng, 2016. "Network of networks in Linux operating system," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 447(C), pages 520-526.
    17. Gao, Yichao & Zheng, Zheng & Qin, Fangyun, 2014. "Analysis of Linux kernel as a complex network," Chaos, Solitons & Fractals, Elsevier, vol. 69(C), pages 246-252.
    18. Wang, Xin-Wei & Chen, Zhen & Han, Chao, 2016. "Scheduling for single agile satellite, redundant targets problem using complex networks theory," Chaos, Solitons & Fractals, Elsevier, vol. 83(C), pages 125-132.
    19. Xia, Yongxiang & Zhang, Wenping & Zhang, Xuejun, 2016. "The effect of capacity redundancy disparity on the robustness of interconnected networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 447(C), pages 561-568.

    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:17:p:3505-3512. 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.