IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0172035.html
   My bibliography  Save this article

Efficient path routing strategy for flows with multiple priorities on scale-free networks

Author

Listed:
  • Xi Zhang
  • Zhili Zhou
  • Dong Cheng

Abstract

In real networks, traffic flows are different in amount as well as their priorities. However, the latter priority has rarely been examined in routing strategy studies. In this paper, a novel routing algorithm, which is based on the efficient path routing strategy (EP), is proposed to overcome network congestion problem caused by large amount of traffic flows with different priorities. In this scheme, traffic flows with different priorities are transmitted through different routing paths, which are based on EP with different parameters. Simulation results show that the traffic capacity for flows with different priorities can be enhanced by 12% with this method, compared with EP. In addition, the new method contributes to more balanced network traffic load distribution and reduces average transmission jump and delay of packets.

Suggested Citation

  • 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.
    • Handle: RePEc:plo:pone00:0172035
    DOI: 10.1371/journal.pone.0172035
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0172035
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0172035&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0172035?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
    ---><---

    References listed on IDEAS

    as
    1. M. Ericsson & M.G.C. Resende & P.M. Pardalos, 2002. "A Genetic Algorithm for the Weight Setting Problem in OSPF Routing," Journal of Combinatorial Optimization, Springer, vol. 6(3), pages 299-333, September.
    2. 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.
    3. Tan, Fei & Xia, Yongxiang, 2013. "Hybrid routing on scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(18), pages 4146-4153.
    4. 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.
    5. Guan, Zhi-Hong & Chen, Long & Qian, Tong-Hui, 2011. "Routing in scale-free networks based on expanding betweenness centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(6), pages 1131-1138.
    6. Kawamoto, Hiroki & Igarashi, Akito, 2012. "Efficient packet routing strategy in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(3), pages 895-904.
    7. Zhong-Yuan Jiang & Man-Gui Liang, 2012. "Improved Efficient Routing Strategy On Scale-Free Networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 23(02), pages 1-11.
    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. Yedong Shen & Fangfang Gou & Jia Wu, 2022. "Node Screening Method Based on Federated Learning with IoT in Opportunistic Social Networks," Mathematics, MDPI, vol. 10(10), pages 1-27, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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).
    2. 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.
    3. 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.
    4. Ayşegül Altın & Bernard Fortz & Mikkel Thorup & Hakan Ümit, 2013. "Intra-domain traffic engineering with shortest path routing protocols," Annals of Operations Research, Springer, vol. 204(1), pages 65-95, April.
    5. 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.
    6. Waseem Akram & Muaz Niazi & Laszlo Barna Iantovics & Athanasios V. Vasilakos, 2019. "Towards Agent-Based Model Specification of Smart Grid: A Cognitive Agent-Based Computing Approach," Interdisciplinary Description of Complex Systems - scientific journal, Croatian Interdisciplinary Society Provider Homepage: http://indecs.eu, vol. 17(3-B), pages 546-585.
    7. Saxena, Chandni & Doja, M.N. & Ahmad, Tanvir, 2018. "Group based centrality for immunization of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 508(C), pages 35-47.
    8. Andrade, Carlos E. & Toso, Rodrigo F. & Gonçalves, José F. & Resende, Mauricio G.C., 2021. "The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications," European Journal of Operational Research, Elsevier, vol. 289(1), pages 17-30.
    9. 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.
    10. Gonçalves, J.F. & Mendes, J.J.M. & Resende, M.G.C., 2008. "A genetic algorithm for the resource constrained multi-project scheduling problem," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1171-1190, September.
    11. 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.
    12. 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).
    13. 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.
    14. Gonçalves, José Fernando & Resende, Mauricio G.C., 2015. "A biased random-key genetic algorithm for the unequal area facility layout problem," European Journal of Operational Research, Elsevier, vol. 246(1), pages 86-107.
    15. José Fernando Gonçalves & Mauricio G. C. Resende, 2011. "A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 180-201, August.
    16. Mauricio Resende, 2012. "Biased random-key genetic algorithms with applications in telecommunications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 130-153, April.
    17. L. A. C. Roque & D. B. M. M. Fontes & F. A. C. C. Fontes, 2014. "A hybrid biased random key genetic algorithm approach for the unit commitment problem," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 140-166, July.
    18. 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.
    19. Julliany S. Brandão & Thiago F. Noronha & Celso C. Ribeiro, 2016. "A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks," Journal of Global Optimization, Springer, vol. 65(4), pages 813-835, August.
    20. Changyong Zhang, 2017. "An origin-based model for unique shortest path routing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 935-951, August.

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0172035. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.