Skip to Main Content
In this paper, we propose a mobility-based load control scheme, which consists of two sub-algorithms: (1) a threshold-based admission control algorithm; and (2) a session-to-mobility ratio (SMR) based replacement algorithm. Here the SMR is defined as a ratio of the session arrival rate to the handoff rate. When the number of mobile nodes (MNs) at a mobile anchor point (MAP) reaches to the full capacity, the MAP replaces an existing MN at the MAP, whose SMR is high, with an MN that just requests a binding update. The replaced MN is redirected to its home agent. We analyze the proposed load control scheme using the Markov chain model in terms of the new MN blocking probability and the ongoing MN dropping probability. By combining the threshold-based admission control with the SMR-based replacement, the above probabilities are lowered significantly compared to the threshold-based admission control alone.