分级移动ipv6中的移动锚点选择算法  

Algorithm of mobility anchor point selection in hierarchical mobile IPv6

作　　者：陈魏鑫[1] 林林[1] 韩国栋[1] 

机构地区：[1]国家数字交换系统工程技术研究中心,郑州450002

出　　处：《计算机应用》2008年第6期1481-1485,共5页journal of Computer Applications

基　　金：国家863计划项目(2004AA103130)

摘　　要：分析了分级移动ipv6(HMipv6)现有移动锚点(MAP)选择算法的不足,提出了一种支持负载分担的新算法。该算法利用MAP的优先级值来表征MAP自身的负载情况,引入了分担门限对特定MAP的负载情况进行考察,并依据考察结果动态调整MAP选择策略,实现方法简单易行。仿真结果表明,该算法在有效减少协议开销的同时,达到了较好的负载分担效果。To improve the performance of Mobility Anchor Point （MAP） selection algorithm for Hierarchical Mobile IPv6 （HMIPv6）, a novel algorithm supporting load sharing was proposed. The algorithm utilized MAP＇s preference value to characterize the load on that MAP, introduced sharing threshold to judge whether the MAP called ＂ quasi-MAP＂ had overloaded, and adjusted the selection policy dynamically by the judgment. It is easy to implement. Simulation results indicate that the proposed algorithm reduces protocol cost greatly and has a good effect on load sharing.

关 键 词：分级移动IPV6 负载分担 移动锚点 协议开销 

分 类 号：TN915.04[电子电信—通信与信息系统] TP393.04[电子电信—信息与通信工程]