A performance comparison of mobility anchor point selection schemes in Hierarchical Mobile IPv6 networks

摘要: Hierarchical Mobile IPv6 (HMIPv6) introduces a mobility anchor point (MAP) that localizes the signaling traffic and hence reduces handoff latency. In addition to processing binding update messages from mobile nodes (MNs) on behalf of MNs' home agents (HAs), MAP performs data tunneling destined or originated MNs, both which will burden substantially as network size grows. To provide scalable robust Internet services large number visiting multiple MAPs be deployed. such an environment, how select appropriate has vital effect overall performance. this paper, we choose four selection schemes: furthest scheme, nearest mobility-based adaptive scheme. Then, compare their performances quantitatively in terms overhead load balancing. It can shown dynamic schemes (i.e., schemes) are better than static schemes), since serving depending MN's characteristics, e.g., session activity. addition, scheme achieves low implementation balancing compared with