Table of Content

Open Access iconOpen Access



Ant Colony Optimization for Multi-Objective Multicast Routing

Ahmed Y. Hamed1, Monagi H. Alkinani2, M. R. Hassan3, *

1 Department of Computer Science, Faculty of Computers and Information, 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 Department of Mathematics and Computer Science, Faculty of Science, Aswan University, Aswan, 81528, Egypt.

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

Computers, Materials & Continua 2020, 63(3), 1159-1173.


In the distributed networks, many applications send information from a source node to multiple destination nodes. To support these applications requirements, the paper presents a multi-objective algorithm based on ant colonies to construct a multicast tree for data transmission in a computer network. The proposed algorithm simultaneously optimizes total weight (cost, delay and hop) of the multicast tree. Experimental results prove the proposed algorithm outperforms a recently published Multi-objective Multicast Algorithm specially designed for solving the multicast routing problem. Also, it is able to find a better solution with fast convergence speed and high reliability.


Cite This Article

A. Y. Hamed, M. H. Alkinani and M. R. Hassan, "Ant colony optimization for multi-objective multicast routing," Computers, Materials & Continua, vol. 63, no.3, pp. 1159–1173, 2020.


cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2316


  • 1412


  • 0


Related articles

Share Link