Resolving mobile database overflow with most idle replacement

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

*此作品的通信作者

研究成果: Article同行評審

14 引文 斯高帕斯(Scopus)

摘要

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.

原文American English
頁(從 - 到)1953-1961
頁數9
期刊IEEE Journal on Selected Areas in Communications
19
發行號10
DOIs
出版狀態Published - 1 10月 2001

指紋

深入研究「Resolving mobile database overflow with most idle replacement」主題。共同形成了獨特的指紋。

引用此