%0 Journal Article
%T On-Demand Branching Multicast<br>按需分枝组播
%A JIN Zhi-Quan
%A XIANG Xiao-Jing
%A CHEN Pei-Pei
%A <br>金志权
%A 项晓晶
%A 陈佩佩
%J 软件学报
%D 2003
%I 
%X 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.
%K multicast routing
%K multicast distributed tree
%K multicast model
%K coexistence and convertibility<br>组播路由
%K 组播分布树
%K 组播模型
%K 共存性和互转换性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=7786A4B51F8FF841&yid=D43C4A19B2EE3C0A&vid=F3583C8E78166B9E&iid=38B194292C032A66&sid=4AB4178709047BE3&eid=B4F9D541F855CF96&journal_id=1000-9825&journal_name=软件学报&referenced_num=2&reference_num=15