An Algorithm Based on the Genetic Tabu Hybrid Strategy for Delay-Constrained Multicast Routing
Lin Huang · 2010
An novel algorithm based on the hrbrid strategy of the genetic algorithm and the tabu search method for delay-constrained least-cost multicast routing(GATSA)is proposed to solve delay-constrained multicast routing problem.The algorithm uses Dijkstra Kth shortest path algorithm to search out paths from the source to all destination nodes satisfying the maximam delay costraint,by operations of selection、 crossover and mumation in the genetic tabu hybrids strategy,finds the multicas tree satisfying constraint.Simulations show that performance of the algorithm is steady,and its cost is close to BSMA algorithm whose performance is best at present.Finally,thealgorithm has characteristics of quickness and lower delay.