Dynamic Routing from One to Group of Nodes using Elitism Based GA - Novel Multi parameter Approach

All real time applications require dynamic routing mechanism for the incoming data to adapt to the change in the multicast group and these applications need optimization of more than one parameter. In this paper, we propose a Genetic Algorithm (GA) based method for dynamic routing from one to many destinations with minimization of two parameters such as cost and end to end delay. We have used repair function to avoid loops and neglect the infeasible chromosomes during crossover and mutation. The simulation results show that the performance of the proposed method is better than other heuristic algorithm.