CAJ | 학술논문

可扩展性是影响多播在MPLS网络大规模使用的主要问题,为解决该问题提出了一种基于双向共享树的多播流聚合算法.它根据节点之间的关系计算多播流的可聚合度,然后将标记边缘路由器聚类生成共享树的叶子节点集,并由树管理服务器计算双向共享树的拓扑结构,最后将可聚合度大于指定阈值的多播流汇聚到树中.实验结果表明,该算法可以大幅缩小MPLS标记的占用,简化中间节点的处理过程,减少路由器的转发状态,大大提高了MPLS多播的可扩展性.
가확전성시영향다파재MPLS망락대규모사용적주요문제,위해결해문제제출료일충기우쌍향공향수적다파류취합산법.타근거절점지간적관계계산다파류적가취합도,연후장표기변연로유기취류생성공향수적협자절점집,병유수관리복무기계산쌍향공향수적탁복결구,최후장가취합도대우지정역치적다파류회취도수중.실험결과표명,해산법가이대폭축소MPLS표기적점용,간화중간절점적처리과정,감소로유기적전발상태,대대제고료MPLS다파적가확전성.
Scalability is the mainly problem that impedes the extensive deployment of multicast in MPLS networks.An aggregation algorithm for multicast flow based on bidirectional shared tree was proposed in order to resolve the problem.The aggregated degrees of multicast flows were computed according to the relation among nodes.The label edge routers were clustered into the sets of leaf nodes on shared trees,and tree manager server computed the topology of bidirectional shared trees.The multicast flows,whose aggregated degrees were greater than the specific threshold,were finally converged into the trees.The test result indicates that it can greatly reduce the occupation of MPLS labels.The processes of medium nodes are simplified and the forwarding states of routers are reduced in the algorithm.It will greatly enhance the scalability of MPLS multicast.