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 条
  • [41] Kannadhasan S, 2013, 2013 IEEE CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGIES (ICT 2013), P151
  • [42] Small but slow world: How network topology and burstiness slow down spreading
    Karsai, M.
    Kivela, M.
    Pan, R. K.
    Kaski, K.
    Kertesz, J.
    Barabasi, A. -L.
    Saramaki, J.
    [J]. PHYSICAL REVIEW E, 2011, 83 (02):
  • [43] Kumar M, 2015, INT CONF IND INF SYS, P66, DOI 10.1109/ICIINFS.2015.7398987
  • [44] Lee M. Y., 2020, IOP Conference Series: Materials Science and Engineering, V765, DOI 10.1088/1757-899X/765/1/012070
  • [45] Graph partitioning strategy for the topology design of industrial network
    Li, F.
    Zhang, Q.
    Zhang, W.
    [J]. IET COMMUNICATIONS, 2007, 1 (06) : 1104 - 1110
  • [46] Li Nan, 2019, 2019 International Conference on Computer Network, Electronic and Automation (ICCNEA). Proceedings, P93, DOI 10.1109/ICCNEA.2019.00028
  • [47] Liming Chen, 2019, 2019 IEEE Innovative Smart Grid Technologies - Asia (ISGT Asia), P894, DOI 10.1109/ISGT-Asia.2019.8881751
  • [48] A Fast Algorithm for Community Detection of Network Systems in Smart City
    Liu, Fangyu
    Xie, Gang
    [J]. IEEE ACCESS, 2019, 7 : 51856 - 51865
  • [49] Liu MF, 2016, 2016 INTERNATIONAL CONFERENCE ON INFORMATION SYSTEM AND ARTIFICIAL INTELLIGENCE (ISAI 2016), P603, DOI [10.1109/ISAI.2016.0133, 10.1109/ISAI.2016.129]
  • [50] Manikandan G., 2018, P INT C I SMAC IOT S, P378, DOI [10.1109/I-SMAC.2018.8653656, DOI 10.1109/I-SMAC.2018.8653656]