可扩展的基于源树的MPLS组播算法  

Scalable MPLS multicast algorithm based on source specific

作　　者：鲍丽红[1] 王昱[1] 韩双旺[1] 

机构地区：[1]天水师范学院数理与信息科学学院,甘肃天水741001

出　　处：《计算机工程与设计》2007年第20期4946-4948,4954,共4页Computer Engineering and Design

摘　　要：MPLS是下一代互连网的核心技术,基于MPLS的组播技术的研究是目前网络研究的热点问题之一。IP组播技术经过了20多年的发展,并没有取得预期的成功,主要的原因是组播路由缺乏可扩展性,任何组播协议的设计,可扩展性是首要考虑的问题。分析了组播可扩展的相关概念及其研究现状,在此基础上,提出了将Tunneling和Non-branching算法应用于MPLS域实现基于信源树的组播算法,该算法具有更好的可扩展性,可以有效提高传统IP组播中可扩展性、流量聚合等问题,基于NS-2的仿真结果证明了该算法的可行性和有效性。MPLS is one of core technologies of the next Internet. The research ofmulticast based on the MPLS group is one of present network research hot topics. Through 20 years of development, IP multicast technology doesn＇t achieve expected goal. The main reason is that existing IP multicast routing protocols scale poorly with l^ge number of groups. The designment of any multicast protocols, requires to take scalability into the first consideration. Concepts and current research oflP multicast routing forwarding state are analysed, on the basis of that a MPLS multicast algorithm is studied based on source specific to use tunneling, non-branching algorithm. The algorithm has better scalability, and can present an efficient solution for multicast scalability, garlic aggregation problems. Simulated results based on NS-2 testify the feasibility and efficiency of the algorithm.

关 键 词：组播 多协议标签交换技术 多协议标签交换组播 可扩展性 网络仿真器 

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