Liu Fang, Yang Hai-chao . A Multicast Routing Algorithm Based on Clonal Strategies[J]. Journal of Electronics & Information Technology, 2004, 26(11): 1825-1829.
Citation:
Liu Fang, Yang Hai-chao . A Multicast Routing Algorithm Based on Clonal Strategies[J]. Journal of Electronics & Information Technology, 2004, 26(11): 1825-1829.
Liu Fang, Yang Hai-chao . A Multicast Routing Algorithm Based on Clonal Strategies[J]. Journal of Electronics & Information Technology, 2004, 26(11): 1825-1829.
Citation:
Liu Fang, Yang Hai-chao . A Multicast Routing Algorithm Based on Clonal Strategies[J]. Journal of Electronics & Information Technology, 2004, 26(11): 1825-1829.
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年.