J4 ›› 2010, Vol. 32 ›› Issue (1): 5-7.doi: 10.3969/j.issn.1007130X.2010.
• 论文 • Previous Articles Next Articles
Received:
Revised:
Online:
Published:
Contact:
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
CLC Number:
TP393.04
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 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://joces.nudt.edu.cn/EN/10.3969/j.issn.1007130X.2010.
http://joces.nudt.edu.cn/EN/Y2010/V32/I1/5