Abstract:

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 between 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.