Open Access

ARTICLE

A Genetic Algorithm Optimization for Multi-Objective Multicast Routing

Ahmed Y. Hamed¹, Monagi H. Alkinani², M. R. Hassan^3,*

1 Faculty of Computers and Information, Department of Computer Science, Sohag University, Sohag, 82524, Egypt
2 Department of Computer Science and Artificial Intelligence, College of Computer Science and Engineering, University of Jeddah, Jeddah, 21959, Saudi Arabia
3 Faculty of Science, Department of Mathematics and Computer Science, Aswan University, Aswan, 81528, Egypt

* Corresponding Author: M. R. Hassan. Email:

Intelligent Automation & Soft Computing 2020, 26(6), 1201-1216. https://doi.org/10.32604/iasc.2020.012663

Received 08 July 2020; Accepted 12 August 2020; Issue published 24 December 2020

Abstract

Many applications require to send information from a source node to multiple destinations nodes. To support these applications, the paper presents a multi-objective based genetic algorithm, which is used in the construction of the multicast tree for data transmission in a computer network. The proposed algorithm simultaneously optimizes total weights (cost, delay, and hop) of the multicast tree. Experimental results prove that the proposed algorithm outperforms a recently published Multi-objective Multicast Algorithm specially designed for solving the multicast routing problem. Also, the proposed approach has been applied to ten-node and twenty-node network to illustrate its efficiency. In addition, the execution time is reported for each studied case and the obtained results are compared with the results obtained by the previously based ant colony algorithm presented recently to solve the same problem. Finality, summing up the three objectives (cost, delay, and hop) to be one objective called the weight of the tree to speed up the searching process by using the proposed algorithm to find the best solutions.

---

Keywords

---

Citations