A GTBA Algorithm for Aggregated Multicast
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 groupmember 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.
aggregated multicast group-tree matching statemerging merging rate
YanlingZhou
Department of Computer Science and Technology AnHui SanLian University Hefei, China
国际会议
武汉
英文
740-743
2009-11-18（万方平台首次上网日期，不代表论文的发表时间）