基于链路共享的多源选播路由算法  

Multisource manycast routing algorithm based on link share

作　　者：张宏滨[1] 谭学功[1,2] 李宁[1] 

机构地区：[1]中山大学信息科学与技术学院,广州510006 [2]暨南大学华文学院,广州510610

出　　处：《计算机工程与应用》2013年第16期103-106,共4页Computer Engineering and Applications

基　　金：国家自然科学基金-广东联合基金重点项目基金(No.U0735002)

摘　　要：选播(manycast)作为一种新型的通信模式,吸引了研究人员越来越大的兴趣。MSPT(Manycast Shortest Path Tree)算法是一种应用广泛的选播路由算法。但是,它没有考虑整体网络资源的利用;DDMC(Destination-Driven for Manycast)算法较好地解决了单源点选播最小生成树问题,但应用场景只是针对"一个对多个中的任意个"。针对"多个对多个中的任意个"的多源选播路由问题,在DDMC算法的基础上作了一些改进。仿真实验结果表明,改进的选播路由算法MBLS(Manycast Based-Link-Share)基于链路共享机制,在空间复杂度和时间复杂度相同的情况下,在选播森林每源点成本上优于MSPT算法。As a new kind of communication method, manycast is attracting increasing interest from researchers. Manycast Short- est Path Tree（MSPT） is a widely-used manycast routing algorithm. However, MSPT does not consider overall network resource utilization. DDMC （Destination-Driven for Manyeast） can solve the minimal spanning tree problem for single source manycast, but it just considers ＂one-to-some-of-many＂ situation. Improvements have been made to solve ＂many-to-some-of-many＂ multi- source manycast routing problem on the basis of DDMC. Simulation results show that the modified algorithm MBLS （Manycast Based-Link-Share） outperforms MSPT in per-source manycast forest cost under the condition of the same space complexity and time complexity.

关 键 词：选播 网络路由 多点到多点网络 

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