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

An effective edge-adding strategy for enhancing network traffic capacity

Author

Listed:
  • Ma, Jinlong
  • Kong, Lingkang
  • Li, Hui-Jia

Abstract

With the rapid development of technology, the number of packets that need to be transmitted in the network is increasing, which leads to network congestion and reduces the user experience. Therefore, it is necessary to adjust the transmission path of packets in the network to improve the transmission threshold of packets in the network. In this paper, we abstract the real world network into a scale-free network for research, using nodes to represent individuals in reality, and edges to represent connections between individuals. Scale-free networks have serious inhomogeneity. Nodes in scale-free networks cannot be connected to all nodes in the network, which makes some gaps in the network. “Structural hole” describes the gaps in the network, which make some nodes have certain controllability to the whole network. But it only considers the relationship between nodes and their neighbors, without considering the overall structure of the whole network topology. K-shell decomposition algorithm can efficiently and accurately identify the location of nodes in the network. Therefore, K-shell decomposition algorithm is a global index. However, it still has shortcomings that does not consider the topological relationship between neighbors. Both structural hole and K-shell theory can characterize the importance of nodes. The combination of the two can make up for each other’s flaws and make the importance of nodes in the network more even. The more even the node importance, the more even the load of the node, the greater the increase in network traffic capacity. In this paper, we propose a network edge-adding strategy combining the structural hole theory and the k-shell algorithm to improve the traffic capacity. Extensive simulations have been performed to estimate the effectiveness of the proposed method under the efficient routing strategy. According to the simulation results, we can see that when the network size is fixed, regardless of the average degree of nodes, our proposed strategy improves the network traffic capacity, reduces the maximum betweenness centrality of nodes, and makes the load of nodes in the network more average. At the same time, our strategy improves the robustness of the network.

Suggested Citation

  • 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).
    • Handle: RePEc:eee:phsmap:v:609:y:2023:i:c:s0378437122008792
    DOI: 10.1016/j.physa.2022.128321
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. 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.
    2. Yiguang Bai & Sanyang Liu & Zhaohui Zhang, 2017. "Effective hybrid link-adding strategy to enhance network transport efficiency for scale-free networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 28(08), pages 1-13, August.
    3. Wang, Jun & Zhang, Qian-Ming & Zhou, Tao, 2019. "Tag-aware link prediction algorithm in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 105-111.
    4. Shuai Zhang & Man-Gui Liang & Zhong-Yuan Jiang & Jia-Jing Wu, 2014. "Effective strategy of adding links for improving network transport efficiency on complex networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 25(06), pages 1-14.
    5. Yoshida, Akinori & Shimada, Yutaka & Kimura, Takayuki, 2021. "Efficient routing strategy with transmission history information and its surrogate analysis," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 566(C).
    6. Wu, Jian-Jun & Gao, Zi-You & Sun, Hui-jun, 2008. "Optimal traffic networks topology: A complex networks perspective," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(4), pages 1025-1032.
    7. Kumari, Suchi & Saroha, Abhishek & Singh, Anurag, 2020. "Efficient edge rewiring strategies for enhancement in network capacity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    8. Réka Albert & Hawoong Jeong & Albert-László Barabási, 1999. "Diameter of the World-Wide Web," Nature, Nature, vol. 401(6749), pages 130-131, September.
    9. 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.
    10. Liu, Wei & Chang, Zhenhai & Jia, Caiyan & Zheng, Yimei, 2022. "A generative node-attribute network model for detecting generalized structure and semantics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 588(C).
    11. 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.
    12. Yang, Xiaoxia & Yang, Xiaoli & Pan, Fuquan & Kang, Yuanlei & Zhang, Jihui, 2021. "The effect of passenger attributes on alighting and boarding efficiency based on social force model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 565(C).
    13. Jiang, Zhong-Yuan & Liang, Man-Gui & An, Wen-Juan, 2014. "Effects of efficient edge rewiring strategies on network transport efficiency," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 394(C), pages 379-385.
    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. Shen, Yi & Yang, Huang & Xie, Yuangcheng & Liu, Yang & Ren, Gang, 2023. "Adaptive robustness optimization against network cascading congestion induced by fluctuant load via a bilateral-adaptive strategy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 630(C).

    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. 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. Mohd-Zaid, Fairul & Kabban, Christine M. Schubert & Deckro, Richard F. & White, Edward D., 2017. "Parameter specification for the degree distribution of simulated Barabási–Albert graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 141-152.
    3. He, He & Yang, Bo & Hu, Xiaoming, 2016. "Exploring community structure in networks by consensus dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 342-353.
    4. Elias Carroni & Paolo Pin & Simone Righi, 2020. "Bring a Friend! Privately or Publicly?," Management Science, INFORMS, vol. 66(5), pages 2269-2290, May.
    5. Duan, Shuyu & Wen, Tao & Jiang, Wen, 2019. "A new information dimension of complex network based on Rényi entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 529-542.
    6. Baek, Seung Ki & Kim, Tae Young & Kim, Beom Jun, 2008. "Testing a priority-based queue model with Linux command histories," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(14), pages 3660-3668.
    7. Freddy Hernán Cepeda López, 2008. "La topología de redes como herramienta de seguimiento en el Sistema de Pagos de Alto Valor en Colombia," Borradores de Economia 513, Banco de la Republica de Colombia.
    8. Chung-Yuan Huang & Chuen-Tsai Sun & Hsun-Cheng Lin, 2005. "Influence of Local Information on Social Simulations in Small-World Network Models," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 8(4), pages 1-8.
    9. Xue Guo & Hu Zhang & Tianhai Tian, 2019. "Multi-Likelihood Methods for Developing Stock Relationship Networks Using Financial Big Data," Papers 1906.08088, arXiv.org.
    10. Chang, Chia-ling & Chen, Shu-heng, 2011. "Interactions in DSGE models: The Boltzmann-Gibbs machine and social networks approach," Economics Discussion Papers 2011-25, Kiel Institute for the World Economy (IfW Kiel).
    11. Stefano Breschi & Lucia Cusmano, 2002. "Unveiling the Texture of a European Research Area: Emergence of Oligarchic Networks under EU Framework Programmes," KITeS Working Papers 130, KITeS, Centre for Knowledge, Internationalization and Technology Studies, Universita' Bocconi, Milano, Italy, revised Jul 2002.
    12. He, Xuan & Zhao, Hai & Cai, Wei & Li, Guang-Guang & Pei, Fan-Dong, 2015. "Analyzing the structure of earthquake network by k-core decomposition," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 421(C), pages 34-43.
    13. Huang, Huilin, 2009. "The degree sequences of an asymmetrical growing network," Statistics & Probability Letters, Elsevier, vol. 79(4), pages 420-425, February.
    14. Gianluca Carnabuci, 2013. "The distribution of technological progress," Empirical Economics, Springer, vol. 44(3), pages 1143-1154, June.
    15. Zhengzheng Pan, 2012. "Opinions and Networks: How Do They Effect Each Other," Computational Economics, Springer;Society for Computational Economics, vol. 39(2), pages 157-171, February.
    16. Laurienti, Paul J. & Joyce, Karen E. & Telesford, Qawi K. & Burdette, Jonathan H. & Hayasaka, Satoru, 2011. "Universal fractal scaling of self-organized networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(20), pages 3608-3613.
    17. Chen, Qinghua & Shi, Dinghua, 2004. "The modeling of scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 335(1), pages 240-248.
    18. Feng Xie & David Levinson, 2009. "Modeling the Growth of Transportation Networks: A Comprehensive Review," Networks and Spatial Economics, Springer, vol. 9(3), pages 291-307, September.
    19. Srayan Datta & Eytan Adar, 2018. "A generative model for scientific concept hierarchies," PLOS ONE, Public Library of Science, vol. 13(2), pages 1-19, February.
    20. López-Pintado, Dunia, 2008. "Diffusion in complex social networks," Games and Economic Behavior, Elsevier, vol. 62(2), pages 573-590, March.

    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:609:y:2023:i:c:s0378437122008792. 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: 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.