•  
  •  
 

Author Country (or Countries)

Egypt

Abstract

The current paper presents a new algorithm based on Anti Colony Optimization (ACO), which finds optimum path and multicast tree optimizes total weight (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.

Suggested Reviewers

N/A

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/jsap/100308

Share

COinS