Eliminating Overflow for Large-Scale Mobility Databases in Cellular Telephone Networks
IEEE Transactions on Computers
A cost-efficient signaling protocol for mobility application part (MAP) in IMT-2000 systems
Proceedings of the 7th annual international conference on Mobile computing and networking
A New Overflow Replacement Policy for Efficient Location Management in Mobile Networks
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Design and Analysis of Location Management for 3G Cellular Networks
IEEE Transactions on Parallel and Distributed Systems
An adaptive hierarchical mobile IPv6 using mobility profile: Research Articles
Wireless Communications & Mobile Computing
Design and Analysis of Optimal Multi-Level Hierarchical Mobile IPv6 Networks
Wireless Personal Communications: An International Journal
Deploying home agent load sharing in operational mobile IPv6 networks
Proceedings of first ACM/IEEE international workshop on Mobility in the evolving internet architecture
An adaptive mobility anchor point selection scheme in Hierarchical Mobile IPv6 networks
Computer Communications
A survey of mobility management in next-generation all-IP-based wireless systems
IEEE Wireless Communications
Modeling opportunity driven multiple access in UMTS
IEEE Transactions on Wireless Communications
Dynamic hierarchical mobility management strategy for mobile IP networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
By introducing a mobility anchor point (MAP), Hierarchical Mobile IPv6 (HMIPv6) reduces the signaling overhead and handoff latency associated with Mobile IPv6. In this paper, we propose a mobility-based load control (MLC) scheme, which mitigates the burden of the MAP in fully distributed and adaptive manners. The MLC scheme combines two algorithms: a threshold-based admission control algorithm and a session-to-mobility ratio (SMR)-based replacement algorithm. The threshold-based admission control algorithm gives higher priority to ongoing mobile nodes (MNs) than new MNs, by blocking new MNs when the number of MNs being serviced by the MAP is greater than a predetermined threshold. On the other hand, the SMR-based replacement algorithm achieves efficient MAP load distribution by considering MNs' traffic and mobility patterns. We analyze the MLC scheme using the continuous time Markov chain in terms of the new MN blocking probability, ongoing MN dropping probability, and binding update cost. Also, the MAP processing latency is evaluated based on the M/G/1 queueing model. Analytical and simulation results demonstrate that the MLC scheme outperforms other schemes and thus it is a viable solution for scalable HMIPv6 networks.