A survey on the network models applied in the industrial network optimization

被引:5
作者
Dong, Chao [1 ]
Xiong, Xiaoxiong [1 ]
Xue, Qiulin [1 ]
Zhang, Zhengzhen [2 ]
Niu, Kai [1 ]
Zhang, Ping [1 ]
机构
[1] Beijing Univ Posts & Telecommun, Key Lab Universal Wireless Commun, Minist Educ, Beijing 100876, Peoples R China
[2] Beijing Union Univ, Smart City Coll, Beijing 100024, Peoples R China
基金
中国国家自然科学基金;
关键词
industrial network; small-scale network; large-scale network; graph theory; system entropy; SMALL-WORLD; INTERNET; COMMUNICATION; CONVERGENCE; VEHICLES; SERVICE; SCHEME; DESIGN;
D O I
10.1007/s11432-023-3868-6
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Network architecture design is critical for optimizing industrial networks. Network architectures can be classified into small-scale networks and large-scale networks based on scale. Graph theory is an efficient mathematical tool for network topology modeling. For small-scale networks, their structure often has regular topology. For large-scale ones, the current body of work mainly focuses on random characteristics of network nodes and edges. Recently, widely used models include random networks, small-world networks, and scale-free networks. In this study, starting from the scale of the network, network modeling methods based on graph theory as well as their industrial applications, are summarized and analyzed. Moreover, a novel network performance metric, called system entropy, is proposed. From the perspective of mathematical properties, an analysis of its non-negativity and concavity is performed. The advantage of system entropy is that it can cover the existing regular networks, random networks, small-world networks, and scale-free networks, and has strong generality. The simulation results reveal that this proposed metric can achieve the comparison of various industrial networks under different models.
引用
收藏
页数:19
相关论文
共 101 条
  • [1] [Anonymous], 2010, Graph Theory and Complex Networks: An Introduction
  • [2] [Anonymous], 2013, Evolution of networks: From biological nets to the Internet and WWW, DOI DOI 10.1007/s00454-002-0743-x
  • [3] [Anonymous], 2006, Mining Graph Data, DOI DOI 10.1002/0470073047
  • [4] On the Analysis of Newman & Watts and Kleinberg Small World Models in Wireless Sensor Networks
    Araujo, Renan P.
    de Souza, Fernanda S. H.
    Ueyama, Jo
    Villas, Leandro A.
    Guidoni, Daniel L.
    [J]. 2015 IEEE 14TH INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS (NCA), 2015, : 17 - 21
  • [5] Multiobjective Small-World Optimization for Energy Saving in Grid Environments
    Arsuaga-Rios, Maria
    Vega-Rodriguez, Miguel A.
    [J]. COMPUTER JOURNAL, 2015, 58 (03) : 432 - 447
  • [6] Scale-free networks
    Barabási, AL
    Bonabeau, E
    [J]. SCIENTIFIC AMERICAN, 2003, 288 (05) : 60 - 69
  • [7] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [8] The Architecture of complexity
    Barabasi, Albert-Lashlo
    [J]. IEEE CONTROL SYSTEMS MAGAZINE, 2007, 27 (04): : 33 - 42
  • [9] Biradar M, 2021, P INT C ADV ELECT CO, P1
  • [10] Bollobas Bela, 2013, Modern graph theory