Efficient recovery of multicast tree in dynamic overlay network

Abstract

Overlay multicast can effectively use the Internet as a lower level infrastructure to provide services to members. Overlay multicast is proposed as an alternative approach for providing multicast services in the Internet. In the overlay multicast protocols, each multicast member is responsible for forwarding the multicast packets. Thus, network failure can occur by leaving or joining of nodes. In such dynamic changes, we strive to recover overlay multicast tree to provide resilient services. We address efficient recovery strategies of multicast in dynamic overlay network. One is instant strategy and the other is centralized strategy. In centralized strategy, we want to solve degree-bounded minimum maximum-delay spanning tree. This problem is known as NP-hard. Thus tabu search is introduced to solve our problem. Through the experiments, we have verified performance of recovery strategies.