摘要
文章研究了不相交路由和相交路由2种冗余路由形式,并通过路由全局可靠性模型对它们进行了建模和分析。在理论分析的基础上提出一种基于蚁群优化的弱段最小化容错组播路由算法—VOMRA,在驱动方式、人工蚂蚁的生成、信息素的更新策略等方面都进行了有针对性的设计,确保可以找出符合性能约束且可靠性最大化的相交双树。仿真结果表明,VOMRA算法与现有算法相比明显提高了故障恢复概率,而故障恢复后组播树的代价与现有算法相当。
This paper analyzes disjoint routing and joint routing by the routing global reliability model.On the basis of theoretical analysis,it alse proposes VOMRA—a weak-segment minimized fault-tolerant multicast routing algorithm based on ant colony optimization,which targets design on aspects of driving mode,the formation of artificial ant,updating strategy of pheromone,to ensure identifying intersection double tree with maximum reliability and performance constraints.Simulation results show that,compared with the existing algorithms,VOMRA algorithm has obviously improved fault recovery probability,and cause same multicast tree cost after restoration.
出处
《信息工程大学学报》
2010年第4期498-503,共6页
Journal of Information Engineering University
基金
国家863计划资助项目(2007AA01Z2a1)
关键词
组播
故障恢复
路由可靠性
蚁群优化
multicast
fault-recovery
routing reliability
ant colony optimization
