动态多播最小生成树算法  

DYNAMIC MINIMUM PATH COST HEURISTIC ALGORITHM

作　　者：胡光岷[1] 李乐民[1] 安红岩[2] 

机构地区：[1]电子科技大学宽带光纤传输与通信系统技术国家重点实验室,成都610054 [2]成都理工大学应用数学系,成都610059

出　　处：《电子与信息学报》2003年第1期88-93,共6页Journal of Electronics & Information Technology

摘　　要：在IP多播网络中,如何选择合适的路由、优化配置,以减少开支,是IP多播业务推广使用的关键。该文针对IP多播动态路由选择的特点和现有算法的不足,提出了一种新的动态多播最小生成树算法(DMPH),随机网络模型的仿真结果表明:DMPH算法生成的多播树总费用与静态算法基本一致,优于现有的动态算法;计算复杂性较静态算法有很大降低。In IP multicast network, how to choose appropriate multicast routes and optimize the configuration for reducing the cost of multicast are the key to popularize the multicast service. Aiming at characteristics of multicast routing algorithm and weakness of existing algorithm, a new dynamic multicast routing algorithm called Dynamic Minimum Path cost Heuristic (DMPH) is introduce. The simulation results show that the cost of tree from DMPH is similar to that of tree from static algorithm, and DMPH is faster than existing dynamic algorithms.

关 键 词：多播最小生成树算法 IP多播技术 动态路由选择 通信网络 

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