一个有效的分布式移动IP组播路由算法  

Efficient multicast routing algorithm using distributed method based on mobile IP

作　　者：周灵[1] 孙亚民[1] 

机构地区：[1]南京理工大学计算机科学与技术学院,南京210094

出　　处：《计算机工程与应用》2007年第29期135-139,共5页Computer Engineering and Applications

基　　金：教育部博士点专项基金资助( No.20050288015);湖南省教育厅资助科研课题( the Research Project of Department of Education of Hu-nan Province; China under Grant No.05C059)

摘　　要：为了优化移动IP环境下组播树的代价,减少移动结点的切换时延,设计了分布式移动IP组播路由算法BNSBMR(Bone NodeSet-Based Multicast Routing Algorithm)。该算法使用"骨干结点集"的思想,能大大降低组播树代价,并优化切换时延;同时使用分布式的策略来进行设计,使得算法具有良好的可扩展性,有利于在大规模移动Internet上的实现。仿真实验表明:根据该算法生成的组播树代价、时延等性能明显优于其他同类移动IP组播路由算法。In order to optimize the cost of muhicast tree,reduce the handover latency under mobile IP environment,a distributed algorithm called BNSBMR（Bone Node Set-Based Muhicast Routing Algorithm） is designed in the paper.The algorithm depends on the idea of bone node set,which leads to lower tree cost and handover delay.Moreover,a distributed method is introduced to implement BNSBMR,by which the algorithm can be efficiently used in large size network.Experiment simulation results show that distributed BNSBMR can greatly optimize the multicast tree much more than other mobile IP algorithm according to cast and delay.

关 键 词：分布式算法 移动IP 组播路由 骨干结点集 实验仿真 

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