By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yanling Zhou ; Dept. of Comput. Sci. & Technol., Univ. Hefei, Hefei, China ; Youqin Zhu

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.

Published in:

Multimedia Information Networking and Security (MINES), 2012 Fourth International Conference on

Date of Conference:

2-4 Nov. 2012