首页    期刊浏览 2024年11月28日 星期四
登录注册

文章基本信息

  • 标题:Tree Growth Based ACO Algorithm for Solving the Bandwidth-Delay-Constrained Least-Cost Multicast Routing Problem
  • 本地全文:下载
  • 作者:Moheb R. Girgis ; Tarek M. Mahmoud ; Ghada W. Hanna
  • 期刊名称:International Journal of Computer and Information Technology
  • 印刷版ISSN:2279-0764
  • 出版年度:2016
  • 卷号:5
  • 期号:6
  • 页码:516-523
  • 出版社:International Journal of Computer and Information Technology
  • 摘要:Quality of service (QoS) multicast routing is an NP multi-objective optimization problem. This paper presents a treegrowth based ant colony optimization (ACO) algorithm (TGACO) for solving the least-cost multicast routing problem with three QoS constraints, namely: bandwidth, delay and delay jitter. In the proposed algorithm, each ant generates a multicast tree using tree growth, such that an edge is added to the tree if it satisfies only the bandwidth constraint. Then, the fitness of the constructed multicast tree is evaluated by using a cost function that includes the delay and delay jitter constraints. Depending on the fitness of the constructed multicast trees, the local and global best multicast trees can be determined. In the TGACO algorithm, the ants perform local and global pheromone updates. In the local pheromone update, pheromone evaporation is performed by all ants after each construction step, while the global pheromone update is performed at the end of each iteration by the local best and the global best ants. The paper also presents the results of the experiments that have been conducted to evaluate the performance of the proposed algorithm.
  • 关键词:QoS multicast routing; Least;cost multicast tree; Ant colony algorithm; Tree growth
国家哲学社会科学文献中心版权所有