Title :
A GTBA algorithm for Aggregated Multicast
Author_Institution :
Dept. of Comput. Sci. & Technol., AnHui SanLian Univ., Hefei, China
Abstract :
The main question of aggregated Multicast is how to match group to tree perfectly. In this paper, we present a new group-tree matching algorithm which is based on group-member matched group-tree matching algorithm, and here it is called GTBA algorithm. It is presented on the base of analyzing and concluding the traditional group-tree matching algorithms´ advantages and disadvantages. The GTBA algorithm can realize the multicast trees merging in the presence of saving the network bandwidth resources. Due to the dynamic of Multicast, the GTBA algorithm can achieve refresh the forwarding table quickly and consequently improves the forwarding efficiency in the network. Finally, we prove that the validity of the GTBA algorithm by simulation.
Keywords :
merging; multicast communication; GTBA algorithm; aggregated multicast; forwarding efficiency; forwarding table quickly; group-tree matching algorithm; Algorithm design and analysis; Analytical models; Bandwidth; Computer science; Computer security; Costs; Electronic mail; Information security; Merging; Multicast algorithms; aggregated multicast; group-tree matching; merging rate; state-merging;
Conference_Titel :
Multimedia Information Networking and Security, 2009. MINES '09. International Conference on
Conference_Location :
Hubei
Print_ISBN :
978-0-7695-3843-3
Electronic_ISBN :
978-1-4244-5068-8
DOI :
10.1109/MINES.2009.236
