基于代理的覆盖网组播生成树算法研究  

Research on Proxy-based Overlay Multicast Spanning Tree Algorithms

作　　者：林龙新[1] 周杰[1] 张凌[1] 叶昭[1] 

机构地区：[1]华南理工大学广东省计算机网络重点实验室,广州510641

出　　处：《计算机科学》2008年第12期98-101,共4页Computer Science

基　　金：国家"973"计划项目(2003CB314805);国家科技基础条件平台项目(2005DKA64001);2005年粤港关键领域重点突破项目"IPv6核心路由器研发与产品化"

摘　　要：利用覆盖网组播技术构建组播服务平台是一种可行的提供组播服务的方案。基于代理的覆盖网组播兼具覆盖网组播的灵活性和IP组播的高效性的特点。结合节点的带宽、处理延迟和节点间的通信延迟给出一个完善的基于代理的覆盖网组播模型,根据此模型设计了求节点度受限的具有最小平均延迟的组播转发树生成算法。探讨了主机节点在进行数据分组复制转发时的转发顺序对平均延迟的影响,给出并证明了主机节点对数据分组复制转发的最优策略。通过仿真实验验证了所给算法和最优复制转发策略的有效性。The overlay multicast technology is being recognized as a feasible alternative to construct the general multicast service infrastructure. Proxy-based overlay multicast technology combines the feature of easy deployment of overlay multicast with high performance of IP multicast. By considering the node＇s bandwidth, process delay and communication delay between nodes, proposed a more appropriate overlay multicast model. Based on the model, a multicast tree con- struction algorithm with degree-bounded and minimum average delay was designed. Then the relationship between the average delay and the packet＇ s forwarding orders was considered when a host forwards the copies of a packet to the downstream hosts, and an optimal forwarding strategy was proposed and proved. The simulation results show that the algorithm and optimal forwarding strategy are effective.

关 键 词：覆盖网组播 延迟 生成树 

分 类 号：TP393.4[自动化与计算机技术—计算机应用技术] TP311.2[自动化与计算机技术—计算机科学与技术]