组播聚合中高效的可扩展组-树匹配算法  

Scalable Group-tree Matching Algorithm in Aggregated Multicast

作　　者：郝俊瑞[1] 余少华[1,2] 

机构地区：[1]华中科技大学计算机科学与技术学院,湖北武汉430074 [2]武汉邮电科学研究院,湖北武汉430074

出　　处：《小型微型计算机系统》2008年第10期1781-1785,共5页Journal of Chinese Computer Systems

基　　金：国家“八六三”项目MSR城域网实用化项目(2005AA121411)资助

摘　　要：当网络中同时存在大量的的组播组的时候,IP组播的可扩展性问题变得非常突出.对组播聚合中的组播组-树的匹配算法进行了研究,提出了一种高效的可扩展的组播组-树匹配算法(SGTM算法).在确定组播组的匹配树过程中,通过将组播树按照其开销进行排序以及扩展处理,降低了在查找过程中所检查的组播树的数量,提高了聚合组播算法的执行速度.并引入了对组播聚合性能进行度量的参数,结果表明算法与传统的组播聚合算法相比在同等性能的情况下执行速度更快.IP multicast suffers from scalability problems when the number of simultaneously active multicast groups is very large. Aggregated multieast improves the state scalability by allowing several groups to be aggregated to the same delivery tree. It can reduce the required multicast state and the management overhead for the distribution trees. In this paper, an algorithm called SGTM （Scalable Group-Tree Match algorithm） are proposed, which performs faster aggregations than previous aggregation algorithms by evaluating fewer trees for each group, while keeping the same performance. The paper introduces metrics to measure multicast state and tree management overhead for multicast schemes. The simulation results show the scalability and the fastness of SGTM than the previous algorithm.

关 键 词：IP组播 聚合组播 聚合树 组播树匹配算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]