基于最优路径下的通信网络设计研究  

Research on Communication Network Design Based on Optimal Path

作　　者：杨鼎康 丁洪伟[1] 张瀚越 胡坤 马宏伟 李艾珊 Yang Dingkang;Ding Hongwei;Zhang Hanyue;Hu Kun;Ma Hongwei;Li Aishan(Department of Information,Yunnan University,Kunming Yunnan 650500,China;Fudan University,Shanghai 200433,China)

机构地区：[1]云南大学信息学院,云南昆明650500 [2]复旦大学,上海200433

出　　处：《信息与电脑》2020年第8期148-152,共5页Information & Computer

基　　金：国家自然科学基金资助项目(项目编号:60362001);云南省自然科学基础基金资助项目(项目编号:61461053)。

摘　　要：针对研究城市之间有线通信网络节点的最优连接路径和节点遭破坏后的修复设计问题,笔者基于图论思想建立网络通信距离模型,结合TSP问题和蚁群算法得到最优连通顺序和最短路径长度;根据不同位置的多通信节点遭破坏状况,充分考虑局部最优和网络稳定性原则,通过建立连通集修复模型和位置确定模型,提出改进Floyd连通算法得到了最优修复节点数量、地理位置和连接方式,并利用BP神经网络模拟现实修复环境,验证了网络的抗毁坏性和良好连通性能。Aiming at the optimal connection path between the nodes of the wired communication network between cities and repair problems of damaged nodes,a model of network communication distance is established based on the graph theory,the optimal connection order and the shortest path length can be obtained by combining problem TSP with ant colony algorithm;According to the situation that multiple communication nodes in different locations are damaged,and the principle of local optimization and network stability are fully considered,an improved Floyd connection algorithm is proposed to obtain the optimal number of nodes that need to be repaired,geographical location and connection mode through the establishment of the repair model and location determination model of the connected set,and the BP neural network is used to simulate the real repair environment to verify the network's anti damage performance and connectivity.

关 键 词：通信网络 改进Floyd算法 最优路径 BP神经网络 抗毁坏性 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术] TP301.6[自动化与计算机技术—计算机科学与技术]