Resolving mobile database overflow with most idle replacement
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1961 | en_US |
dc.citation.issue |
10 | en_US |
dc.citation.spage |
1953 | en_US |
dc.citation.volume |
19 | en_US |
dc.citation.woscount |
10 | |
dc.contributor.author |
Hung, HN | en_US |
dc.contributor.author |
Lin, YB | en_US |
dc.contributor.author |
Peng, NF | en_US |
dc.contributor.author |
Yang, SR | en_US |
dc.contributor.department |
統計學研究所 | zh_TW |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Institute of Statistics | en_US |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:43:24Z | |
dc.date.available |
2014-12-08T15:43:24Z | |
dc.date.issued |
2001-10-01 | en_US |
dc.description.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. | en_US |
dc.identifier.doi |
10.1109/49.957310 | en_US |
dc.identifier.issn |
0733-8716 | en_US |
dc.identifier.journal |
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1109/49.957310 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/29382 | |
dc.identifier.wosnumber |
WOS:000171610700012 | |
dc.language.iso |
en_US | en_US |
dc.subject |
database overflow | en_US |
dc.subject |
mobility management | en_US |
dc.subject |
personal communications service | en_US |
dc.subject |
visitor location register | en_US |
dc.title |
Resolving mobile database overflow with most idle replacement | en_US |
dc.type |
Article | en_US |
檔案
- 000171610700012.pdf (399.2 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Hung, H., Lin, Y., Peng, N., & Yang, S. (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
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/29382