基于骨干结点集的移动IP组播路由算法研究  

Research on Multicast Routing Algorithm for Mobile IP Based on Bone Node Set

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

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

出　　处：《计算机研究与发展》2008年第7期1126-1132,共7页Journal of Computer Research and Development

基　　金：国家教育部博士点专项基金项目(20050288015)

摘　　要：为了优化移动IP组播生成树代价,减少移动结点切换加入时延和信息传输时延,引入了移动IP"骨干结点集"思想,设计了移动IP组播路由算法BNSBMR(bone node set-based multicast routing algorithm)."骨干结点集"是移动IP环境下满足一定条件的IP子网接入路由器AR(access router)的集合.该算法通过"骨干结点集"降低移动IP组播生成树的代价;减少移动结点切换的加入时延;并通过路径优化降低信息传输时延.从理论上证明了算法的正确性,并分析了其计算复杂度.仿真实验表明:BNSBMR算法从树代价、加入时延、传输时延3个方面提高了移动IP环境下组播业务满足QoS约束的能力.In order to optimize the cost of multicast tree,minimize the joined latency,and reduce the transmission delay in mobile and wireless environment,bone node set is introduced to group communication for mobile IP.Based on the idea of bone node set,a multicast routing algorithm called BNSBMR（bone node set-based multicast routing algorithm） is designed in this paper.Bone node set is a dynamic set of mobile IP AR（access router） which satisfies some special conditions.BNSBMR can efficiently construct a series of multicast trees for mobile IP and characters itself in three aspects.Firstly,it optimizes the cost of multicast tree and reduces the bandwidth consumption by using bone node set.Secondly,it reduces the joined latency for mobile node to join multicast session,which is helpful to achieve a fast handover.Thirdly,the transmission delay for multicast packet is lessened by sharing those bone nodes.Correctness of BNSBMR is proved and the time complexity is analyzed in theories.Simulation experiments are designed based on a 5×5 mesh topology.Those results show that BNSBMR has optimized cost of multicast tree,reduced the joined latency and minimized the transmission delay.QoS（quality of service） of multicast routing for mobile IP is improved by using bone node set in some degree.

关 键 词：组播路由 移动IP 骨干结点集 代价优化 快速切换 

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