Abstract

Multicast routing is the process of sending data from one or more sources to many destinations. To achieve high efficiency, it is mandatory to minimize path delay due to blocking, and the cost of the path tree to reach destinations [6]. Evolutionary Algorithms have become more and more popular in the domain of searching, optimization and machine learning. Notwithstanding, a mesh is extremely slight when the nodes support high in topologies. The ODMRP needs control messages initiate at each source node of a multicast group to be flooded all over the networks. To optimize this problem, some heuristic approaches like the Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) have been deployed in the route selection strategy [7]. A GA based ODMRP is planned for efficient multicast mesh routing. In this paper, modified genetic operators such as topology encoding, topology crossover and node mutation. The number of senders performing flooding and the issue of restricting the flood of control messages is minimized by reducing the number of forwarding nodes by means of applying the heuristic technique GA. Along with path tree, consistent key chaining and key management is required to execute a standard security framework. This anticipated work will be done using Newton's interpolation technique to implement. It shows efficient encoding scheme of the reconstruction of the multicast mesh topology and the simulation results demonstrate the effectiveness of the sGenODMRP compared to the ODMRP protocol.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.