基于分簇的管道网络断点自动发现方法研究  

Research on automatic discovery of pipe network breakpoints based on clustering

作　　者：王昌廷 WANG Chang-ting(China Mobile Group Design Institute Co.,Ltd.Beijing Branch,Beijing 100038,China)

机构地区：[1]中国移动通信集团设计院有限公司北京分公司,北京100038

出　　处：《电信工程技术与标准化》2024年第10期19-23,共5页Telecom Engineering Technics and Standardization

摘　　要：管道断点的存在,使管道使用效率降低,产生网络隐患。而人工发现断点,以及寻找消除的方案是比较费时费力的工作。本文针对以上问题,研究如何自动发现管道网络断点,将改进的动态分簇和分布式分布簇方法、无向图分析方法和Dijkstra最短路径算法,相互结合,实现了对管道断点的自动发现,极大提高了人工效率和维护质量,对运营商的通信管道网络完善具有较强的现实意义。The existence of pipe breakpoints reduces the utilization efficiency of pipes,and will make network risks.However,manually discovering breakpoints and finding solutions to eliminate them is a time-consuming and labor-intensive task.This article explores how to automatically detect pipeline network breakpoints in response to the above issues.By combining improved dynamic clustering and distributed clustering methods,undirected graph analysis,and Dijkstra's shortest path algorithm,automatic discovery of pipeline breakpoints has been achieved,greatly improving manual efficiency and maintenance quality.The improvement of the communication pipeline network for operators has strong practical signifi cance.

关 键 词：分簇 断点 无向图 DIJKSTRA 

分 类 号：TN913[电子电信—通信与信息系统]