源特定聚集组播的研究  

Research on the Aggregated Source Specific Multicast

作　　者：郭慧[1] 石静[2] 王新生[2] 

机构地区：[1]华北科技学院计算机系,三河065201 [2]燕山大学信息科学与工程学院,秦皇岛066004

出　　处：《科学技术与工程》2009年第7期1712-1715,共4页Science Technology and Engineering

摘　　要：源特定组播技术较好的解决了IP组播中存在的许多问题,但是仍然面临着严重的状态伸缩性问题。源特定聚集组播是解决状态伸缩性问题的一个有效方案。本文在研究源特定聚集组播的基础上,提出了一种新的动态组-树匹配算法,通过减少每个组的匹配次数来提高匹配速度。最后通过实验证明,采用新算法的源特定聚集组播有效的进行了组播状态的聚集,并且提高了聚集速度。Source Specific Multicast（SSM） is a viable solution for the current IP multicast applications.However,SSM still confronts the serious state scalability problem.The aggregated source specific multicast（ASSM） is a method of resolving the scalability problem.The ASSM is researched and a new group-tree matching algorithm is proposed.It performed faster aggregations by evaluating fewer trees for each group.The simulations showed that ASSM using the new group-tree matching algorithm had a good performance.

关 键 词：组播状态伸缩性 源特定组播 源特定聚集组播 组-树匹配算法 

分 类 号：TN915.04[电子电信—通信与信息系统]