J4 ›› 2010, Vol. 32 ›› Issue (1): 5-7.doi: 10.3969/j.issn.1007130X.2010.
• 论文 • 上一篇 下一篇
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
作者简介:
基金资助:
湖南省教育基金资助项目
Received:
Revised:
Online:
Published:
Contact:
摘要:
维护多播信息需要额外的硬件开销,多播体系结构缺乏可扩展性,限制了多播业务的发展。本文在多播中应用MPLS最小冲突路径算法,在分支节点的MPLS中加入多播信息表,实现基于源树的多播树构建,从而解决了MPLS多播中数据转发的标签分配问题,具有良好的扩展性。实验表明,利用MPLS最小冲突路径算法,起到了节约带宽和提高多播性能的作用。
关键词: 多协议标签交换, 最小冲突, 多播, MPLS多播, 关键链路
Abstract:
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 sourcetree 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.
Key words: MPLS;least interference;multicast;MPLS multicast;critical link
中图分类号:
TP393.04
龙鹏飞, 易见波. 基于源树的MPLS最小冲突路径多播算法[J]. J4, 2010, 32(1): 5-7.
LONG Feng-Fei, YI Jian-Bei. A Least Interference Path Algorithm for MPLS Based on Source Trees[J]. J4, 2010, 32(1): 5-7.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://joces.nudt.edu.cn/CN/10.3969/j.issn.1007130X.2010.
http://joces.nudt.edu.cn/CN/Y2010/V32/I1/5