首页 | 本学科首页   官方微博 | 高级检索  
     

基于关键节点的触发重组动态组播路由算法
引用本文:李佐勇,朱文兴.基于关键节点的触发重组动态组播路由算法[J].计算机工程与应用,2007,43(11):140-145.
作者姓名:李佐勇  朱文兴
作者单位:1. 闽江学院,计算机科学系,福州,350108;南京理工大学,计算机科学系,南京,210094
2. 福州大学,计算机科学与技术系,福州,350002
摘    要:提出了一种基于关键节点的触发重组动态组播路由算法(CRKDMR)。它在一定条件下优先选择包含关键节点的路径将新的组播节点连接到已有组播树,以此实现更多链路共享,降低组播树费用。相对于现有的触发重组算法,它提出了更为全面和合理的触发函数。随机网络模型的仿真结果表明,CRKDMR算法的性能好,效差和对树的改变都比较小,同时可以在代价性能和对树的改变间进行很好的权衡。

关 键 词:组播路由  动态算法  重组
文章编号:1002-8331(2007)11-0145-06
收稿时间:2006-5-10
修稿时间:2006-09

Key-Node Based Trigger rearranged Dynamic Multicast Routing Algorithm
LI Zuo-yong,ZHU Wen-xing.Key-Node Based Trigger rearranged Dynamic Multicast Routing Algorithm[J].Computer Engineering and Applications,2007,43(11):140-145.
Authors:LI Zuo-yong  ZHU Wen-xing
Affiliation:1.Department of Computer Science,Minjiang University,Fuzhou 350108,China; 2.Department of Computer Science and Technology,Fuzhou University,Fuzhou 350002,China; 3.Department of Computer Science,Nanjing University of Science and Technology,Nanjing 210094,China
Abstract:This paper presents a key-node based trigger rearranged dynamic multicast routing algorithm named CRKDMR.It will preferentially choose the path including key nodes on certain conditions,by which a new muhicast node is connected to the existing multicast tree.This is beneficial to implementing more link share and reducing multicast tree cost.Furthermore,trigger function of CRKDMR is more comprehensive and rational than that of existing trigger rearranged dynamic multicast routing algorithms.Simulation results show that performance of CRKDMR is better than that of other algorithms.Cost competitiveness and average tree change of CRKDMR are smaller,in the meantime,CRKDMR can achieve a better balance between performance of multicast tree and change of tree.
Keywords:multicast routing  dynamic algorithm  rearrangement
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号