摘要
针对现有方法无法适应虚拟网络动态性和未考虑探针成本的问题,提出一种基于贪心思想的动态探测站点选择算法.该算法优先选取覆盖节点数多并且生成树平均高度最大的节点作为探测站点,并且考虑到虚拟网络的动态性变化,对现有探测站点集合进行适应性处理.仿真结果表明,与现有算法相比,在保证探测效果的前提下,新算法能够适应虚拟网络动态性,而且选择的探测站点能够选择出更少的探针,从而降低探针选择成本.
In order to deal with the dynamic network virtualization environment and reduce the cost of probe selection,a dynamic probe station selection algorithm based on the greedy method was proposed.The algorithm chooses the nodes that can achieve all the virtual nodes and have the maximum height as the probe station. For the dynamic network environment,this algorithm will dynamically select the probe stations in the two scenarios： node adding and node deleting. Simulations show that,compared with the classical algorithm,this dynamic probe station selection algorithm selects less probe and reduces the cost of probe selection while keeping up with the detecting effects in the dynamic network virtualization environment.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2016年第B06期1-5,共5页
Journal of Beijing University of Posts and Telecommunications
基金
国家电网公司科技项目
关键词
网络虚拟化
探测站点选择
生成树
network virtualization
probe station selection
spanning tree
