关键词: 网络虚拟化, 探测站点选择, 生成树

Abstract:

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.

Key words: network virtualization, probe station selection, spanning tree