Open Access
ARTICLE
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: .
Computers, Materials & Continua 2020, 63(3), 1159-1173. https://doi.org/10.32604/cmc.2020.09176
Received 18 November 2019; Accepted 01 March 2020; Issue published 30 April 2020
Abstract
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.
Keywords
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. https://doi.org/10.32604/cmc.2020.09176
Citations