Performance analysis of a fault-tolerant scheme for location management of mobile hosts
We consider the problem of location management of mobile users. The objective is to keep track of the mobile users in order to deliver calls. The IS-41 is a simple strategy for location management used in North America. This strategy is not efficient for some movement and call patterns. Many strategies have been proposed to address efficiently given movement and call patterns.
For mobile users who move frequently but receive relatively rare calls, a forwarding scheme has been shown to outperform the normal IS-41 location management scheme. But the forwarding scheme is more vulnerable to intermediate Visitor Location Registers (VLRs) failure than the IS-41 scheme. On the other hand, the call set-up with forwarding pointers may be costly, as a list of pointers must be traversed. We propose a simple variation to the forwarding scheme to address the fault tolerance weakness and the call set-up cost. The idea is to maintain two paths from the home location server to the last VLR with each path being of half the length of the normal forwarding path. We study and compare the performance of the normal forwarding scheme and our scheme.
Key WordsWireless environment Personal Communications Services Location Management Fault-Tolerance to Visitor Location Registers IS-41 Forwarding Scheme
Unable to display preview. Download preview PDF.
- 1.A. Acharya and B. Badrinath, “Checkpointing distributed applications on mobile computers,” in IEEE Conf. on Parallel and Distributed Information Systems, Oct. 1994.Google Scholar
- 2.I. F. Akyildiz and J. S. Ho, “On location management for personal communications networks,” IEEE Communications Magazine, pp. 138–145, Sept. 1996.Google Scholar
- 3.I. F. Akyildiz, J. S. Ho, and Y.-B. Lin, “Movement-based location update and selective paging for PCS networks,” IEEEIACM Transactions on Networking, pp. 629–638, 1996.Google Scholar
- 4.S. Alagar, R. Rajagopalan, and S. Venkatesan, “Tolerating mobile support station failures,” in Proceedings of IEEE Conf. on Fault Tolerant Systems, pp. 225–231, Dec. 1995.Google Scholar
- 5.N. M. Amato and M. C. Loui, “Checking linked data structures,” in International Symposium on Fault-Tolerant Computing FTCS-24, pp. 164–173, June 1994.Google Scholar
- 6.S. Biaz and N. H. Vaidya, “Tolerating location register failures in mobile environments,” Tech. Rep. 97-015, Department of Computer Science, Texas A&M University at College Station, Dec. 1997.Google Scholar
- 7.Q. Li and S. Vlaovic, “Redundant linked list based cache coherence protocol,” in 1994 IEEE Workshop of Fault-Tolerant Parallel and Distributed Systems, June 1994.Google Scholar
- 8.Y. Lin, “Failure restoration of mobility databases for personal communication networks,” ACM-Baltzer Wireless Networks, pp. 365–372, 1995.Google Scholar
- 9.Y. Lin and R. Jain, “Performance modeling of an auxiliary user location strategy in a PCS network,” ACM-Baltzer Wireless Networks, pp. 197–210, June 1995.Google Scholar
- 10.C. Lo and R. Wolff, “Estimated network database transaction volume to support wireless personal data communications applications,” in Proc. Conf. on Communications, 1993.Google Scholar
- 11.K. Meier-Hellstern and E. Alonso, “The use of SS7 and GSM to support high density personal communications,” in Proceedings Int'l Conference on Communications, 1992.Google Scholar
- 12.A. Modaressi and R. Skoog, “Signaling system no. 7,” IEEE Com. Mag., July 1990.Google Scholar
- 13.D. Pradhan, P. Krishna, and N. Vaidya, “Recovery in mobile environments: Design and trade-off analysis,” in 26th Int'l Symposium on Fault-Tolerant Computing, June 1996.Google Scholar
- 14.S. Rangarajan, K. Ratnam, and A. T. Dahbura, “A fault-tolerant protocol for location directory maintenance in mobile networks,” in 25th Int'l Symposium on Fault-Tolerant Computing, June 1995. *** DIRECT SUPPORT *** A0008D07 00022Google Scholar