@article{(Open Science Index):https://publications.waset.org/pdf/5095,
	  title     = {Dynamic Routing to Multiple Destinations in IP Networks using Hybrid Genetic Algorithm (DRHGA)},
	  author    = {K. Vijayalakshmi and  S. Radhakrishnan},
	  country	= {},
	  institution	= {},
	  abstract     = {In this paper we have proposed a novel dynamic least cost multicast routing protocol using hybrid genetic algorithm for IP networks. Our protocol finds the multicast tree with minimum cost subject to delay, degree, and bandwidth constraints. The proposed protocol has the following features: i. Heuristic local search function has been devised and embedded with normal genetic operation to increase the speed and to get the optimized tree, ii. It is efficient to handle the dynamic situation arises due to either change in the multicast group membership or node / link failure, iii. Two different crossover and mutation probabilities have been used for maintaining the diversity of solution and quick convergence. The simulation results have shown that our proposed protocol generates dynamic multicast tree with lower cost. Results have also shown that the proposed algorithm has better convergence rate, better dynamic request success rate and less execution time than other existing algorithms. Effects of degree and delay constraints have also been analyzed for the multicast tree interns of search success rate.
},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {2},
	  number    = {12},
	  year      = {2008},
	  pages     = {4287 - 4294},
	  ee        = {https://publications.waset.org/pdf/5095},
	  url   	= {https://publications.waset.org/vol/24},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 24, 2008},
	}