Delay bound multicast routing algorithm using evolutionary programming
Sushma Jain, Jaydev Sharma · 2008
The real time communication networks are designed to support multimedia applications requiring quality of services (QoS). The multicasting is needed when number of users want to communicate simultaneously. This paper present an approach based on evolutionary programming to solve the QoS constrained multicast routing problem, which is a NP complete problem. The multicast tree is obtained corresponding to optimum (minimum) routing cost subjected to end-to-end delay constraints. The algorithm is tested to obtain optimum multicast trees for different sets of source and destinations on 8-node undirected and 10-node directed networks. The convergence of the proposed algorithm is fast because it relies on mutation and selection and the optimum solution is obtained for both undirected and directed graphs.