A Multicast Routing Algorithm with Delay-constrained Based on Tabu Search
Cao Hongxin · Jisuanji gongcheng · 2005
A novel algorithm based on tabu search for delay-constrained least-cost multicast routing (TSBDMA) is proposed to solve delay-constrained multicast routing problem. This algorithm makes use of the characteristics of flexible memory function and tabu rule in TS algorithm, starts with an initial least delay tree, generates neighborhood structure based on exchange edge operations, and finds multicast tree satisfying constraint. A large number of simulations demonstrate that the algorithm has characteristics of nice cost performance, high reliability, fast convergence speed and low delay.