摘要： 组播的状态伸缩性问题是目前困扰组播技术发展的一个难题。该文分析了一种解决组播状态问题的方法——聚集组播和聚集组播的组-树匹配算法。提出一种动态匹配算法——FDMA，通过对网络中聚集树的管理来减少匹配次数，从而提高聚集速度。在仿真实验中，FDMA算法使组-树匹配次数减少了80%以上，聚集组播的实时性得到了较大的提高。

关键词: 组播状态伸缩性, 聚集组播, 组-树匹配算法

Abstract: The scalability of multicast is a problem of multicast technology. A method of resolving the scalability problem——aggregated multicast and the group-tree matching algorithm are analyzed. A dynamic match algorithm——Fast Dynamic Matching Algorithm(FDMA) is proposed. FDMA algorithm can raise the aggregating speed. And by the management of aggregated trees, it can decrease matching times. In the simulations, the group-tree matching times decrease by over 80%. So the real-time property is improved greatly.

Key words: multicast scalability, aggregated multicast, group-tree matching algorithm

中图分类号: 

• TP393