%0 Journal Article
%T A Clone Based Multicast Algorithm with Adjustable Parameter<br>参数可调的克隆多播路由算法
%A LIU Fang
%A YANG Hai-Chao
%A <br>刘芳
%A 杨海潮
%J 软件学报
%D 2005
%I 
%X The problem of computing delay-constrained minimum-cost multicast trees is of great interest in the last few years. So far, the Bounded Shortest Multicast Algorithm (BSMA) has been thought to be the best constrained multicast algorithm. However, the large computation time restricts its application. As a global optimizing algorithm, Genetic algorithm (GA) is applied to solve the problem of multicast more and more. GA has more powerful searching ability than traditional algorithm, however, the property of "prematurity" makes it difficult to get a good multicast tree. A Clonal Strategies (CS) based multicast algorithm is presented in this paper, which saliently solves the "prematurity" problem in Genetic based multicast algorithm. Furthermore, the algorithm is accelerated by using an adjustable parameter to reduce the search space. The algorithm has the property of simple realization and flexible control. The simulated results show that CS has better performance than BSMA and GA.
%K multicast
%K BSMA (bounded shortest multicast algorithm)
%K GA (genetic algorithm)
%K clonal strategy
%K delay constrained<br>多播路由
%K BSMA
%K 遗传算法
%K 克隆策略
%K 时延限制
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=4374A3E13F95B644&yid=2DD7160C83D0ACED&vid=7801E6FC5AE9020C&iid=CA4FD0336C81A37A&sid=769BD58726D66E7D&eid=2DBBF45CC176713E&journal_id=1000-9825&journal_name=软件学报&referenced_num=12&reference_num=11