基于快速图挖掘的网络拓扑局部调节区域算法  

Network Topology Local Adjustment Region Algorithm Based on Fast Graph Mining

作　　者：余平[1] 胡玲 YU Ping;HU Ling(School of Artificial Intelligence and Big Data, Chongqing College of Electronic Engineering, Chongqing 401331, China;Education Administrator Office, Neijinag Normal University, Neijiang Sichuan 641100, China)

机构地区：[1]重庆电子工程职业学院人工智能与大数据学院,重庆401331 [2]内江师范学院教务处,四川内江641100

出　　处：《西南师范大学学报（自然科学版）》2019年第5期121-125,共5页Journal of Southwest China Normal University(Natural Science Edition)

基　　金：四川省教育厅自然科学重点科研项目(13ZA0001)

摘　　要：针对IP骨干网重新配置中繁重工作量的问题,提出一种快速图挖掘算法来解决网络拓扑的局部调节区域问题,解决了从网络拓扑中找到组件时子图同构的NP-hard问题,减少了网络重构的操作工作量.该文提出的启发式图挖掘算法顶点,称为顶点目标搜索(vertex targeting search,VTS)算法,通过考虑网络操作条件减少了搜索空间的大小.实验结果表明,该文方法可以快速得到搜索网络模式图,与其他方法比较,该文具有较少的搜索时间,说明该文方法具有可行性和有效性.Aiming at the heavy workload in the reconfiguration of IP backbone network, a fast graph mining algorithm has been proposed to solve the problem of local adjustment area of network topology, and solve the NP-hard problem of subgraph isomorphism when finding components from network topology, and to reduce the workload of network reconfiguration. In this paper, a heuristic graph mining algorithm called vertex targeting search(VTS) algorithm has been proposed, which reduces the size of search space by considering network operation conditions. The experimental results show that this method can quickly obtain the search network pattern. Compared with other methods, this method has less search time, which shows the feasibility and validity of this method.

关 键 词：组件分析 图形挖掘 网络拓扑 顶点目标搜索 子图同构问题 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]