A new overflow replacement policy for efficient location management in mobile networks

Ying Luo; Yi Pan; Jie Li; Yang Xiao; Xiaola Lin

doi:10.1109/ICDCSW.2003.1203655

A new overflow replacement policy for efficient location management in mobile networks

Ying Luo
, Yi Pan
, Jie Li
, Yang Xiao
, Xiaola Lin

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

3 Citations (Scopus)

Abstract

Location management is one of the most important issues in mobile networking systems. Most current mobile systems employ a two-tier database structure to store mobile users' information. HLR (Home Location Register) is used to retrieve user's information, and VLR (Visitor Location Register) is the temporal database for storing visitors' profile. In the case that the number of users exceeds the capacity of the VLR due to mobility, database overflow occurs. In this paper, we propose a new policy, the least frequent replacement policy, which selects the least frequently accessed users as replacement candidates. Extensive simulation is carried out for predicting the performance of the existing replacement policies and the proposed least frequent policy. Our simulation results show that the most idle and least frequent policies outperform the inactive and random replacement policies in most cases and that the least frequent policy performs slightly better than the most idle replacement policy. © 2002 IEEE.

Original language	English
Title of host publication	Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003
Publisher	IEEE
Pages	830-835
ISBN (Print)	0769519210, 9780769519210
DOIs	https://doi.org/10.1109/ICDCSW.2003.1203655
Publication status	Published - 2003
Externally published	Yes
Event	23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003 - Providence, United States Duration: 19 May 2003 → 22 May 2003

Publication series

Name	Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003

Conference

Conference	23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003
Place	United States
City	Providence
Period	19/05/03 → 22/05/03

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

Research Keywords

Computer network management
Computer science
Costs
Distributed databases
Information retrieval
Intelligent networks
Memory management
Mobile computing
Predictive models
Registers

Access Output

10.1109/ICDCSW.2003.1203655

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Luo, Y., Pan, Y., Li, J., Xiao, Y., & Lin, X. (2003). A new overflow replacement policy for efficient location management in mobile networks. In Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003 (pp. 830-835). Article 1203655 (Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003). IEEE. https://doi.org/10.1109/ICDCSW.2003.1203655

@inproceedings{e9baa0f55f8148f588a5a07242b3e31a,

title = "A new overflow replacement policy for efficient location management in mobile networks",

abstract = "Location management is one of the most important issues in mobile networking systems. Most current mobile systems employ a two-tier database structure to store mobile users' information. HLR (Home Location Register) is used to retrieve user's information, and VLR (Visitor Location Register) is the temporal database for storing visitors' profile. In the case that the number of users exceeds the capacity of the VLR due to mobility, database overflow occurs. In this paper, we propose a new policy, the least frequent replacement policy, which selects the least frequently accessed users as replacement candidates. Extensive simulation is carried out for predicting the performance of the existing replacement policies and the proposed least frequent policy. Our simulation results show that the most idle and least frequent policies outperform the inactive and random replacement policies in most cases and that the least frequent policy performs slightly better than the most idle replacement policy. {\textcopyright} 2002 IEEE.",

keywords = "Computer network management, Computer science, Costs, Distributed databases, Information retrieval, Intelligent networks, Memory management, Mobile computing, Predictive models, Registers",

author = "Ying Luo and Yi Pan and Jie Li and Yang Xiao and Xiaola Lin",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].; 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003 ; Conference date: 19-05-2003 Through 22-05-2003",

year = "2003",

doi = "10.1109/ICDCSW.2003.1203655",

language = "English",

isbn = "0769519210",

series = "Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003",

publisher = "IEEE",

pages = "830--835",

booktitle = "Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003",

address = "United States",

}

Luo, Y, Pan, Y, Li, J, Xiao, Y & Lin, X 2003, A new overflow replacement policy for efficient location management in mobile networks. in Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003., 1203655, Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003, IEEE, pp. 830-835, 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003, Providence, United States, 19/05/03. https://doi.org/10.1109/ICDCSW.2003.1203655

A new overflow replacement policy for efficient location management in mobile networks. / Luo, Ying; Pan, Yi; Li, Jie et al.
Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003. IEEE, 2003. p. 830-835 1203655 (Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - A new overflow replacement policy for efficient location management in mobile networks

AU - Luo, Ying

AU - Pan, Yi

AU - Li, Jie

AU - Xiao, Yang

AU - Lin, Xiaola

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2003

Y1 - 2003

N2 - Location management is one of the most important issues in mobile networking systems. Most current mobile systems employ a two-tier database structure to store mobile users' information. HLR (Home Location Register) is used to retrieve user's information, and VLR (Visitor Location Register) is the temporal database for storing visitors' profile. In the case that the number of users exceeds the capacity of the VLR due to mobility, database overflow occurs. In this paper, we propose a new policy, the least frequent replacement policy, which selects the least frequently accessed users as replacement candidates. Extensive simulation is carried out for predicting the performance of the existing replacement policies and the proposed least frequent policy. Our simulation results show that the most idle and least frequent policies outperform the inactive and random replacement policies in most cases and that the least frequent policy performs slightly better than the most idle replacement policy. © 2002 IEEE.

AB - Location management is one of the most important issues in mobile networking systems. Most current mobile systems employ a two-tier database structure to store mobile users' information. HLR (Home Location Register) is used to retrieve user's information, and VLR (Visitor Location Register) is the temporal database for storing visitors' profile. In the case that the number of users exceeds the capacity of the VLR due to mobility, database overflow occurs. In this paper, we propose a new policy, the least frequent replacement policy, which selects the least frequently accessed users as replacement candidates. Extensive simulation is carried out for predicting the performance of the existing replacement policies and the proposed least frequent policy. Our simulation results show that the most idle and least frequent policies outperform the inactive and random replacement policies in most cases and that the least frequent policy performs slightly better than the most idle replacement policy. © 2002 IEEE.

KW - Computer network management

KW - Computer science

KW - Costs

KW - Distributed databases

KW - Information retrieval

KW - Intelligent networks

KW - Memory management

KW - Mobile computing

KW - Predictive models

KW - Registers

UR - http://www.scopus.com/inward/record.url?scp=84943532715&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84943532715&origin=recordpage

U2 - 10.1109/ICDCSW.2003.1203655

DO - 10.1109/ICDCSW.2003.1203655

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 0769519210

SN - 9780769519210

T3 - Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003

SP - 830

EP - 835

BT - Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003

PB - IEEE

T2 - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003

Y2 - 19 May 2003 through 22 May 2003

ER -

Luo Y, Pan Y, Li J, Xiao Y, Lin X. A new overflow replacement policy for efficient location management in mobile networks. In Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003. IEEE. 2003. p. 830-835. 1203655. (Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003). doi: 10.1109/ICDCSW.2003.1203655

A new overflow replacement policy for efficient location management in mobile networks

Abstract

Publication series

Conference

Bibliographical note

UN SDGs

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this