Tabu Search Algorithm for Core Selection in Multicast Routing

With the development of network multimedia technology, more and more real-time multimedia applications need to transmit information using multicast. The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a shared multicast tree is the selection of the root of the shared tree or the core point. In this paper, we propose an algorithm based on Tabu Search for core selection in multicast routing. This algorithm selects core point by considering both delay and inter-destination delay variation. The simulation results show that the proposed algorithm performs better than the existing algorithms in terms of delay variation subject to the end-to-end delay bound.