Resolving mobile database overflow with most idle replacement

15Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In a personal communications service (PCS) network, mobility databases called visitor location registers (VLRs) are utilized to temporarily store the subscription data and the location information for the roaming users. Because of user mobility, it is possible that the VLR is full when a mobile user arrives. Under such a circumstance, the incoming user has no VLR record and thus cannot receive PCS services. This issue is called VLR overflow. To resolve the VLR overflow problem, a VLR record can be selected for replacement when the VLR is full and then the reclaimed storage is used to hold the record of the requesting user. This paper considers the most idle replacement policy to provide services to mobile users without VLR records. IN this policy, the record with the longest idle time is selected for replacement. We propose an analytic model to investigate the performance of this replacement policy. The analytic results are validated against simulation experiments. The results indicate that our approach effectively resolves the VLR overflow problem.

Cite

CITATION STYLE

APA

Hung, H. N., Lin, Y. B., Peng, N. F., & Yang, S. R. (2001). Resolving mobile database overflow with most idle replacement. IEEE Journal on Selected Areas in Communications, 19(10), 1953–1961. https://doi.org/10.1109/49.957310

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free