A Heuristic Genetic Algorithm for Minimum Diameter Application Layer Multicast Routing with Degree Constraints
Dou Wen-hua · Computer Engineering and Science · 2006
For the difficulty of deploying IP multicast services in the Internet,Application Layer Multicast has been studied as an alternative approach.Application Layer Multicast networks differ from IP networks in many aspects,such as network cost and routing constraints.Minimum diameter application layer multicast routing with degree constraints has been proved to be a NP-complete problem.A heuristic genetic algorithm is proposed to solve this problem.Through extensive simulations,the performance of the proposed algorithm is compared with that of two heuristic greedy algorithms.Experimental results show that the heuristic genetic algorithm has better performance.