An analysis of location record checkpointing interval for mobility database in PCS networks

Authors:
Hung-Hsin Chang;Ming-Feng Chang;Chien-Chao Tseng
Affiliations:
Department of MIS, Chin-min Institute of Technology, MiaoLi, Taiwan, R.O.C.;Department of Computer Science, National Chiao-Tung University, Hsinchu, Taiwan, R.O.C.;Department of Computer Science, National Chiao-Tung University, Hsinchu, Taiwan, R.O.C.
Venue:
Wireless Networks
Year:
2009

Citing 13
Cited 0

A stochastic checkpoint optimization problem

SIAM Journal on Computing
Hashed and hierarchical timing wheels: efficient data structures for implementing a timer facility

IEEE/ACM Transactions on Networking (TON)
Failure restoration of mobility databases for personal communication networks

Wireless Networks
Diskless Checkpointing

IEEE Transactions on Parallel and Distributed Systems
On optimizing the location update costs in the presence of database failures

Wireless Networks
Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems

Mathematics of Operations Research
On the Optimum Checkpoint Interval

Journal of the ACM (JACM)
Analytical Results for Optimal Choice of Location Update Interval for Mobility Database Failure Restoration in PCS Networks

IEEE Transactions on Parallel and Distributed Systems
A first order approximation to the optimum checkpoint interval

Communications of the ACM
An aggressive approach to failure restoration of PCS mobility databases

ACM SIGMOBILE Mobile Computing and Communications Review
Experimental Assessment of Workstation Failures and Their Impact on Checkpointing Systems

FTCS '98 Proceedings of the The Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing
Per-User Checkpointing for Mobility Database Failure Restoration

IEEE Transactions on Mobile Computing
Performance modeling of location tracking systems

ACM SIGMOBILE Mobile Computing and Communications Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mobility database that stores the users' location records is very important to connect calls to mobile users on personal communication networks. If the mobility database fails, calls to mobile users may not be set up in time. This paper studies failure restoration of mobility database. We study per-user location record checkpointing schemes that checkpoint a user's record into a non-volatile storage from time to time on a per-user basis. When the mobility database fails, the user location records can be restored from the backup storage. Numeric analysis has been used to choose the optimum checkpointing interval so that the overall cost is minimized. The cost function that we consider includes the cost of checkpointing a user's location record and the cost of paging a user due to an invalid location record. Our results indicate that when user registration intervals are exponentially distributed, the user record should never be checkpointed if checkpointing costs more than paging. Otherwise, if paging costs more, the user record should be always checkpointed when a user registers.