多源应用层组播问题的研究与仿真  

Research and Simulation of Multi-source Application Level Multicast Problem

作　　者：张谞[1,2] 谢亚光[1] 吴慧中[2] 肖亮[2] 

机构地区：[1]南京电子技术研究所,南京210013 [2]南京理工大学计算机科学与技术学院,南京210094

出　　处：《计算机工程》2009年第13期78-80,共3页Computer Engineering

基　　金：江苏省自然科学基金资助项目(BK200656)

摘　　要：针对多数据源组播应用的通信需求,研究多源应用层组播问题,提出一种考虑节点负载优化和时延约束的多源应用层组播问题模型MALMM和相应的组播路由启发式算法MALMRA。利用线性规划松弛理论,设计一种求MALMM解理论下限的方法。仿真试验结果表明,MALMRA算法所得解优于采用单独计算数据分发树算法ABDD以及ABDDR的解,接近于理论下限,是一个有效的多源应用层组播路由算法。To satisfy with the communication requirements of many-to-many multicast applications, this paper discusses the problem of multi-source application level multicast. A Multi-source Application Level Multicast Model（MALMM） is presented which consider the optimization of overlay node＇s load and constraint of data delivery delay. It devises a Multi-source Application Level Multicast Routing Algorithm（MALMRA） for solving MALMM. In addition, based on linear programming relaxation theory, a method to compute the theoretical lower bound of MALMM＇s solution is introduced. Experimental results show that solutions obtained through MALMRA are close to the theoretical lower bounds as well as better than solutions obtained through ABDD and ABDDR which are algorithms constructing data delivery trees in isolation, it is an efficient MALMRA.

关 键 词：多源 应用层组播 路由算法 线性规划 理论下限 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]