The visitor location register (VLR) is used to store temporary records for roaming users. Due to the limited capacity, the VLR may be full. This phenomenon is called VLR overflow. By replacing an existing record, the incoming user can still receive services. The most-idle replacement (MR) policy was proposed to improve the random replacement (RR) policy. The MR policy is almost the optimum method and outperforms RR policy significantly. However, the MR policy requires global information to find the most-idle user. It needs considerable extra cost and is unfeasible due to the separated VLR databases in the real mobile network. Therefore, we propose the second chance replacement (SCR) policy to overcome these drawbacks. The SCR policy needs only an additional bit in the record. Partial information is sufficient for our method, so it is feasible in the real mobile network. Moreover, the simulation results show that the SCR policy outperforms the MR policy in most scenarios investigated in our study.
[1]
Sheldon M. Ross,et al.
Stochastic Processes
,
2018,
Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.
[2]
Chien-Chao Tseng,et al.
One-Step Pointer Forwarding Strategy for Location Tracking in Distributed HLR Environment
,
1997,
IEEE J. Sel. Areas Commun..
[3]
Yi-Bing Lin.
Overflow control for cellular mobility database
,
2000,
IEEE Trans. Veh. Technol..
[4]
J. Banks,et al.
Discrete-Event System Simulation
,
1995
.
[5]
Yi-Bing Lin,et al.
Eliminating Overflow for Large-Scale Mobility Databases in Cellular Telephone Networks
,
2001,
IEEE Trans. Computers.
[6]
Ravi Jain,et al.
Two user location strategies for personal communications services
,
1994,
IEEE Personal Communications.
[7]
Yi-Bing Lin,et al.
Resolving mobile database overflow with most idle replacement
,
2001,
IEEE J. Sel. Areas Commun..