网络基础设施中重要网元子图的确定

Element Subgraph Discovery in Networks Infrastructures

网元子图是指大规模网络基础设施中包含承载具体业务网元的拓扑子图,网元子图可用于网络基础设施运维中的故障排查、诊断与修复.首先定义重要网元的概念;其次,为确定重要网元子图,提出一个统一框架来度量网元在结构和业务两方面的影响力,将其作为重要网元的衡量标准,并设计了从重要网元扩展生成重要网元子图的高效算法.基于真实的网络基础设施数据以及合成的业务承载数据进行实验,实验结果验证了该方法可以高效地找到高质量的重要网元子图,并用于网络基础设施的运维,提高运维的效率,节省运维的成本.

In many applications,graphs are used to model structural relationships among objects.Large scale network infrastructures can be represented as graphs,where element subgraphs are those subgraphs containing important network elements with many connections and running services.In this paper,we formularize the problem of discovering element subgraphs in network infrastructures.Element subgraphs can help network administrators lower the cost for network infrastructure operation and maintenance.A uniform framework is proposed to model the element importance by using neighborhood influence based on random walk,which considers both structural connections and running services on these network elements.We design an efficient algorithm that skillfully finds the important element subgraphs by expanding the important vertices.Our experiments are based on real data sets with synthetic service information,whose results show that our element subgraphs exhibit high quality.