中文摘要：

覆盖网能有效分离网络应用与底层网络基础设施，提升服务质量（quality of service，QoS）和用户体验（quality of users’experience，QoE）。设计了一种普适性较强的覆盖网拓扑构建算法---基于最小生成树（minimum spanning tree，MST）的拓扑感知度约束（minimum spanning tree-based topology-aware degree bound， MST-TADB）覆盖网构建算法。该方法感知网络拓扑，逐步生成 MST，同时参考节点的转发和计算能力作为节点度约束收敛算法。由仿真结果可知，和同类算法相比，本文方法的故障恢复率、恢复路径跳数惩罚、服务节点平均节点度和时间复杂度综合权衡较好，并保证了所构建的覆盖网的自愈性。

英文摘要：

In order to improve the quality of service （QoS）and the quality of users’experience（QoE）, overlay network can be used to separate the network application and the underlay structure.A novel algorithm named minimum spanning tree-based topology-aware degree bound （MST-TADB）is proposed for perceiving the network topology and gradually generating a minimum spanning tree （MST）to collect overlay logical links. Furthermore,it takes the node degree as the constraint of convergence,while referencing the forwarding and computing capabilities of the node.The simulation results show that the proposed algorithm is a tradeoff be-tween failure recovery ratio,recovery path hop number,average node degree and computation complexity.In summary,MST-TADB can effectively ensure the self-healing of the overlay.