动态多播最小生成树算法
Dynamic mimimum path cost heuristic algorithm
-
摘要: 在IP多播网络中,如何选择合适的路由、优化配置,以减少开支,是IP多播业务推广使用的关键。该文针对IP多播动态路由选择的特点和现有算法的不足,提出了一种新的动态多播最小生成树算法(DMPH),随机网络模型的仿真结果表明:DMPH算法生成的多播树总费用与静态算法基本一致,优于现有的动态算法;计算复杂性较静态算法有很大降低。
-
关键词:
- 多播; 最小代价; 动态算法
Abstract: 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. -
P. Winter, Steiner problem in networks: a survey , Networks, 1987, 17(2), 129-167.[2]Wang Bin, C. Jennifer Hou, Multicast routing and its QoS extension: problem, algorithms and protocols, IEEE Network, 2000, 14(1), 22-35.[3]B.M. Waxman, Routing of multipoint connections, IEEE J. on Selected Areas in Communications, 1988, 6(9), 1617-1622.[4]J. Kadirire.[J].G. Knight, Comparison of dynamic multicast routing algorithms for wide-area packet switched network, IEEE INFOCOM95, Boston, IEEE.1995,:-[5]Hwa-Chun Lin.[J].Shou-Chuan Lai, VTDM-A dynamic multicast routing algorithm, IEEE INFOCOM98, San Francisco, IEEE.1998,:-[6]龙元香,廖建新,陈俊亮,动态启发式最小生成树多播路由算法,北京邮电大学学报,1999,22(3),29-33. -
计量
- 文章访问数: 2493
- HTML全文浏览量: 144
- PDF下载量: 1020
- 被引次数: 0
下载:
