Application Level Multicast Routing Algorithm Based on Clone Selection Strategy

摘要：

The application level multicast tree is constructed on a suppositional overlay network which can be presented as a complete graph.So finding an optimization multicast routing tree with degree constraint is an optimization problem,which can be formulated as minimum average cost spanning tree with a bound problem and is NP-hard.A new multicast routing algorithm based on clone selection strategy is presented to solve the problem. It utilizes the mutation characteristic to find an optimizat ion solution for the global solution scope.The simulation results show that the algorithm has a faster converging speed and better ability of global searching with property of stabilization and agility

关键词： Application level Multicast Clone selection strategy Routing algorithm

作者: Dezhi Wang Jinying Gan Xinwei Cui Deyu Wang

作者单位: Department of Computer and Science,North China Institute of Science and Technology Department of Electrical & Information Science Engineering,North China Institute of Science and Tech

会议类型: 国际会议

会议名称: 2008年国际电子商务、工程及科学领域的分布式计算和应用学术研讨会(2008 International Symposium on Distributed Computing and Applications for Business Engineering and Science)

会议地点: 大连

会议语种:英文

页码: 1012-1017

在线出版日期: 2008-07-27（万方平台首次上网日期，不代表论文的发表时间）