Eliminating the boundary effect of a large-scale personal communication service network simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A cache approach for supporting life-time UPT number
Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Simulation
Wireless and Mobile Network Architectures
Wireless and Mobile Network Architectures
Proactive Power-Aware Cache Management for Mobile Computing Systems
IEEE Transactions on Computers
Proxy Cache Algorithms: Design, Implementation, and Performance
IEEE Transactions on Knowledge and Data Engineering
An Efficient Cache Maintenance Scheme for Mobile Environment
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Performance modeling of location tracking systems
ACM SIGMOBILE Mobile Computing and Communications Review
Mobile and wireless internet: architectures and protocols
IEEE Wireless Communications
Effects of cache mechanism on wireless data access
IEEE Transactions on Wireless Communications
Improving the fault tolerance of GSM networks
IEEE Network: The Magazine of Global Internetworking
Information Assurance: Dependability and Security in Networked Systems
Information Assurance: Dependability and Security in Networked Systems
| Hi-index | 0.00 |
This paper studies the failure restoration of mobility database for Universal Mobile Telecommunications System (UMTS). We consider a per-user checkpointing approach for the Home Location Register (HLR) database. In this approach, individual HLR records are saved into a backup database from time to time. When a failure occurs, the backup record is restored back to the mobility database. We first describe a commonly used basic checkpoint algorithm. Then, we propose a new checkpoint algorithm. An analytic model is developed to compare these two algorithms in terms of the checkpoint cost and the probability that a HLR backup record is obsolete. This analytic model is validated against simulation experiments. Numerical examples indicate that our new algorithm may significantly outperform the basic algorithm in terms of both performance measures.