A Group-Tree Matching Algorithm Based on Forwarding Tag Maximum Match

Aggregated multicast is the main method to solve the problem of lacking labels in MPLS network. Achieving the aggregation of multicast tree must have an effective multicast group-tree matching algorithm. Which problem of the group-tree matching algorithm solves is that the multicast group can match the multicast tree perfectly. We analyze the previous multicast group-tree matching algorithm, and summarize the strengths and the weaknesses of the previous algorithm. At the same time, we propose a new group-tree matching algorithm which is the maximum matching group-tree algorithm based on forwarding tag, here referred to as FT-GTA. It is proposed based on the analysis and the summary of the previous group-tree matching algorithm. The FT-GTA algorithm can realize the multicast trees merging in the presence of saving the network bandwidth resources. Due to the dynamic of Multicast, the FT-GTA algorithm can refresh the forwarding table quickly and consequently improves the forwarding efficiency in the network. Finally, we prove that the validity of the FT-GTA algorithm by simulation.