基于源树的MPLS最小冲突路径多播算法  

A Least Interference Path Algorithm for MPLS Based on Source Trees

作　　者：龙鹏飞[1] 易见波[1] 

机构地区：[1]长沙理工大学计算机与通信工程学院,湖南长沙410114

出　　处：《计算机工程与科学》2010年第1期5-7,63,共4页Computer Engineering & Science

基　　金：湖南省教育基金资助项目(06C115)

摘　　要：维护多播信息需要额外的硬件开销,多播体系结构缺乏可扩展性,限制了多播业务的发展。本文在多播中应用MPLS最小冲突路径算法,在分支节点的MPLS中加入多播信息表,实现基于源树的多播树构建,从而解决了MPLS多播中数据转发的标签分配问题,具有良好的扩展性。实验表明,利用MPLS最小冲突路径算法,起到了节约带宽和提高多播性能的作用。Maintaining multicast information needs additional hardware overhead, and making the multicast architecture lacks scalability, thus limiting the development of multicast services. This paper applies a least interference path algorithm for MPLS in the multicast, adds multicast information table in the branch nodes MPLS, and implements the source-tree multicast over MPLS, so it is able to solve the difficulties of label distribution on data transmission in the MPLS multicast to achieve a good scalability. The simulation result demonstrates that the application of the least Interference path algorithm over MPLS saves bandwidth and improves multicast capability.

关 键 词：多协议标签交换 最小冲突 多播 MPLS多播 关键链路 

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