按需分枝组播  

On-Demand Branching Multicast

作　　者：金志权[1,2] 项晓晶[1,2] 陈佩佩[1,2] 

机构地区：[1]南京大学计算机软件新技术国家重点实验室,江苏南京210093 [2]南京大学计算机科学与技术系,江苏南京210093

出　　处：《软件学报》2003年第3期553-561,共9页Journal of Software

基　　金：Supported by the National High-Tech Research and Development Plan of China under Grant No.2001AA110235 (国家高技术研究发展计划)

摘　　要：在分析总结目前IP组播路由研究的主要成果基础上,提出了一个新的组播路由方案,按需分枝组播.它采用了一种全新的组播树维护方式,即组播树由树上的部分节点(关键节点)维护,不同于现有的组播树由所有树上节点维护的方式,从而节省了网络资源.After analyzing and summarizing the main current research outcomes of IP multicast routing, a multicast routing algorithm called on-demand branching multicast is proposed. On-Demand branching multicast uses a new multicast tree maintenance method, in which the tree is maintained only by partial nodes or key nodes. That is different from the traditional methods in which the tree is maintained by all the nodes on the tree, and so as to save the Internet resources.

关 键 词：分枝组播 组播路上 组播分布树 组播模型 共存性 互转换性 路由器 因特网 

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