Journal of South China University of Technology (Natural Science Edition) ›› 2009, Vol. 37 ›› Issue (10): 89-94.

• Computer Science & Technology • Previous Articles     Next Articles

A Label Aggregation Algorithm for MPLS Multicast Based on Similar Tree

Li Ling-zhi1  Zhu Yan-qin 1.2  Yang Zhe1   

  1. 1. School of Computer Science and Technology, Soochow University, Suzhou 215006, Jiangsu, China; 2. Jiangsu Provincial Key Laboratory of Computer Information Processing Technology, Suzhou 215006, Jiangsu, China
  • Received:2008-10-30 Revised:2009-03-12 Online:2009-10-25 Published:2009-10-25
  • Contact: 李领治（1977-），男，讲师，博士，主要从事计算机网络体系结构研究． E-mail:sdlilingzhi@126．com
  • About author:李领治（1977-），男，讲师，博士，主要从事计算机网络体系结构研究．
  • Supported by:

    国家自然科学基金资助项目（60673041）;江苏省自然科学基金资助项目（BK2009589）;江苏省高校自然科学研究计划项目（08KJB520011）;苏州市重点实验室计划项目（SZS0805）

PDF

858

Abstract:

In this paper, a similar tree-based algorithm is proposed to reduce the label space of muhicast in multiprotocol 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 A 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.

Key words: muhicast, multi-protocol label switching, label, aggregation, similar tree