一种基于克隆策略的多播路由算法
A Multicast Routing Algorithm Based on Clonal Strategies
-
摘要: 该文针对网络计算中的NPcomplet问题一带时延约束的多播路由问题，提出了一种基于克隆策略的路由算法．仿真实验表明，与基于遗传算法的多播路由算法相比，该算法具有更快的收敛速度和更好的全局寻优能力，而且算法稳定、灵活，操作简单．
-
关键词:
- 多播路由;克隆策略;时延约束
Abstract: An algorithm based on Clonal Strategies(CS) is presented to deal with the delay-constrained and least-cost multicast routing problem known as NP-complet. Simulations show that compared with those based on genetic algorithm, the multicast routing based on CS has faster converging speed and better ability of global searching with the property of stabilization, agility and operating simply. -
Kou L. A fast algorithm for the Steiner trees. Acta Informatic, 15(2): 141-145.[2]Takahashi H. An approximate solution for the Steiner problem in graphs, Math. Japonica, 24(6):573-577.[3]Mehrdad Parsa. An interative algorithm for delay-constrained minimum-cost multicasting.IEEE/ACM Trans on Networking, 6(4): 461-474.[4]Salama H F. Evaluation of multicast routing algorithm for real-time communication on high-speed networks. IEEE J on Sel. Areas in Comm, 15(3): 332-345.[5]陈国良等.遗传算法及其应用.北京:人民邮电出版社,1996:28-98.[6]石坚,邹玲等.遗传算法在组播路由选择中的应用.电子学报,2000,28(5):88-89.[7]王新红,王光兴.基于遗传算法的时延受限代价最小组播路由选择方法[J].通信学报,2002,23(3):112-117.[8]刘莹.计算机网略中的多播路由算法.[博士论文],西安:西安电子科技大学,2002.12.[9]刘若辰,杜海峰,焦李成.免疫克隆策略.[研究报告],西安:西安电子科技大学雷达信号处理国家重点实验室,2002年. -
计量
- 文章访问数: 2277
- HTML全文浏览量: 117
- PDF下载量: 786
- 被引次数: 0
下载:
