Ant colony optimization for multi-objective multicast routing

16Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Hamed, A. Y., Alkinani, M. H., & Hassan, M. R. (2020). Ant colony optimization for multi-objective multicast routing. Computers, Materials and Continua, 63(3), 1159–1173. https://doi.org/10.32604/CMC.2020.09176

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free