基于关键节点和多播节点的多播路由算法  

Key-Node and Destination Based Multicast Routing for Low Cost

作　　者：余燕平[1] 赵问道[1] 孟利民[1] 仇佩亮[1] 

机构地区：[1]浙江大学信息与电子工程学系,浙江杭州310027

出　　处：《电路与系统学报》2003年第2期43-47,共5页Journal of Circuits and Systems

摘　　要：在视频会议等多播应用中,降低多播树网络费用非常重要。本文提出了基于关键节点和目的节点的多播路由KDDMC算法。由于在算法中优先考虑采用关键节点,实现更多链路的共享,从而降低网络费用。在随机网络上的仿真结果表明,KDDMC算法的多播树网络费用优于SPH算法。同时证明了KDDMC算法的复杂度为O(n3),且利用所提出的路由表算法易于分布式实现。Low cost is one of the fundamental issue in multicast application such as audio and video conference. One multicast routing algorithm based on key-node and destination is presented. Multicast routing with low cost is achieved through using some key nodes with priority to share some links. The algorithm is found to produce multicast trees with low cost by extensive simulation. Simultaneously, the algorithm can be realized distributedly with a reasonable complexity O(n3).

关 键 词：多播路由算法 STEINER树 

分 类 号：TN915[电子电信—通信与信息系统]