针对现有方法无法适应虚拟网络动态性和未考虑探针成本的问题,提出一种基于贪心思想的动态探测站点选择算法.该算法优先选取覆盖节点数多并且生成树平均高度最大的节点作为探测站点,并且考虑到虚拟网络的动态性变化,对现有探测站点集合进行适应性处理.仿真结果表明,与现有算法相比,在保证探测效果的前提下,新算法能够适应虚拟网络动态性,而且选择的探测站点能够选择出更少的探针,从而降低探针选择成本. Aiming at the problem that the existing methods can not adapt to the dynamics of the virtual network and the cost of the probe is not considered, a dynamic exploration site selection algorithm based on greedy ideas is proposed. The algorithm preferentially selects nodes with a large number of nodes and the highest average spanning tree as probing And take into account the dynamic changes of the virtual network to adaptively process the existing set of detection sites.The simulation results show that compared with the existing algorithms, the new algorithm can adapt to the dynamic of the virtual network , And the selected probing site can select fewer probes, thereby reducing probe selection costs.