组播核心结点选择算法及仿真分析  

Simulation and Analysis of Multicast Core Selection Algorithm

作　　者：肖钢[1] 陈越[1] 黄平川[1] 王星星[1] 

机构地区：[1]信息工程大学电子技术学院,河南郑州450004

出　　处：《系统仿真学报》2006年第z2期897-899,902,共4页Journal of System Simulation

摘　　要：核心结点的选择对组播共享树的形状和路由的性能有重要影响。通过建立组播网络的抽象模型,分析相邻结点之间偏心距的关系,提出了一种适用于大规模网络拓扑的中心结点选择算法,偏心距减小(EccentricityDecreaseAlgorithm,简称EDA)算法。利用VC++语言制作的仿真测试平台,对EDA算法和穷举算法进行了仿真分析。仿真结果表明:EDA算法能够选择出拓扑图的中心结点,在CPU运行时间上优于穷举算法。Core selection plays an important role in the forming of multicast tree and efficient multicast packet delivery. Through constructing an abstract model of multicast network and analyzing the relationship of the neighbor nodes’ eccentricities, EDA (Eccentricity Decrease Algorithm), a core selection algorithm for large-scale network-topology, was proposed. Then it was simulated by VC++ and compared with Exhaust Algorithm. Simulation results show that the EDA can find the center of the topology, and is superior to the Exhaust Algorithm in CPU execution time.

关 键 词：IP组播 核心结点选择 算法 仿真建模 

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