作　　者： ; ; ; ; ;

机构地区： 中南大学信息科学与工程学院

出　　处： 《计算机工程与设计》 2007年第13期3093-3096,共4页

摘　　要： 提出一种新的基于MPLS的组播方法——按需分枝组播方法。该方法采用一种全新的组播树维护方式,即组播树上只有分枝节点处的路由器和本地链路上有组成员的路由器需要保存组播树的有关信息,并参加组播树的维护过程,组播树上的其它路由器只是以普通单播的路由方式组播数据包,无须维护组播树的任何信息。网络仿真实验和与其它算法性能比较分析表明,该方法可有效地提高IP组播的可量测性和减少转发状态。 A new multicast approach which is known as on-demand branching multicast is presented. This approach adopts a new mode of maintaining multicast trees, which only routers that are acting as multicast tree branching node and multicast tree leaf node for a group need to keep forwarding state for that group and to participate the maintenance process of multicast trees. All other non-branching node routers simply forward data packets over traffic engineered unicast routers using MPLS LSPs. At last, the performance of the approach proposed is evaluated by using NS2 simulator and by comparing with the DM algorithm and CtrMcast algorithm. The results show that this approach can effectively reduce forwarding states and enhance scalability.

关 键 词： 组播 多协议标签交换 按需分枝组播 组播树 模拟器 标记交换路径 标签交换路由器 标签分发协议

领　　域： [自动化与计算机技术] [自动化与计算机技术]