An Efficient Hierarchical Scheme for Locating Highly Mobile Users (1998)
| Venue: | ACM Proceedings for International Conference on Information and Knowledge Management (CIKM |
| Citations: | 14 - 4 self |
BibTeX
@INPROCEEDINGS{Pitoura98anefficient,
author = {Evaggelia Pitoura and Ioannis Fudos},
title = {An Efficient Hierarchical Scheme for Locating Highly Mobile Users},
booktitle = {ACM Proceedings for International Conference on Information and Knowledge Management (CIKM},
year = {1998},
pages = {218--225}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
To accommodate the increase in user population in future personal communication systems, hierarchical architectures of location databases have been proposed. In this paper, a scheme based on forwarding pointers is presented, that reduces the cost of the overall network and database traffic generated by frequent location updates in such hierarchical architectures. To reduce the number of forwarding pointers that need to be traversed to locate a user, auxiliary caching techniques are presented. Various conditions for purging the chain of forwarding pointers and updating the database are also introduced. Special care is given so that the scheme correctly supports the concurrent execution of updates and lookups. The applicability of the scheme and the performance of the caching techniques are demonstrated through a number of experiments for a range of call to mobility ratios and for a variety of moving and calling behaviors. Keywords: Mobile Computing, Distributed Database Systems, Locati...
