CAJ | 학술논문

为了减少多协议标记交换(MPLS)网络多播标记的占用空间,文中提出了一种基于相似树的求解算法,将与同一共用树相似的多播组进行标记聚合.首先运用模糊聚类的方法生成共用树,然后以共用树为基础进行多播树的构建和组成员的更新.动态多播组成员的变化大多只会造成标记边缘路由器(LER)节点类型的转换,不需要重新分配标记.实验结果表明,此算法可以大大缩小MPLS标记的占用,在SymbollAp元素数量大于最大数量的1/2、相似度阈值为0.75时,能够将大于50%的多播组进行标记聚合,而平均每组多用的节点数小于0.50.
위료감소다협의표기교환(MPLS)망락다파표기적점용공간,문중제출료일충기우상사수적구해산법,장여동일공용수상사적다파조진행표기취합.수선운용모호취류적방법생성공용수,연후이공용수위기출진행다파수적구건화조성원적경신.동태다파조성원적변화대다지회조성표기변연로유기(LER)절점류형적전환,불수요중신분배표기.실험결과표명,차산법가이대대축소MPLS표기적점용,재SymbollAp원소수량대우최대수량적1/2、상사도역치위0.75시,능구장대우50%적다파조진행표기취합,이평균매조다용적절점수소우0.50.
In this paper, a similar tree-based algorithm is proposed to reduce the label space of multicast in multi-protocol label switching (MPLS) networks. The proposed algorithm aggregates the labels of multicast groups that are similar to the same common tree. In this algorithm, common trees are created via fuzzy clustering, based on which multicast trees are built and group members are updated. The change of dynamic multicast memberships can only give rise to the type conversion of label edge router (LER) nodes, without redistributing labels for the groups. Test results indicate that the proposed algorithm greatly reduces the quantity of MPLS labels being used, and that, when the number of λ element is greater than half of the maximum and when the similarity threshold equals 0.75, more than 50% of the multicast groups can be aggregated, with an average waste of less than 0.50 nodes in each group.