Resolving mobile database overflow with most idle replacement

Hui-Nien Hung*, Yi-Bing Lin, Nan Fu Peng, Shun Ren Yang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

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.

Original languageEnglish
Pages (from-to)1953-1961
Number of pages9
JournalIEEE Journal on Selected Areas in Communications
Volume19
Issue number10
DOIs
StatePublished - 1 Oct 2001

Keywords

  • Database overflow
  • Mobility management
  • Personal communications service
  • Visitor location register

Fingerprint Dive into the research topics of 'Resolving mobile database overflow with most idle replacement'. Together they form a unique fingerprint.

Cite this