An optimal on-line algorithm for K-servers on trees
SIAM Journal on Computing
Navigating in unfamiliar geometric terrain
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
New results on server problems
SIAM Journal on Discrete Mathematics
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Online tracking of mobile users
Journal of the ACM (JACM)
An adaptive location management strategy for mobile IP
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
Information Processing Letters
Local anchor scheme for reducing signaling costs in personal communications networks
IEEE/ACM Transactions on Networking (TON)
Dynamic hashing + quorum = efficient location management for mobile computing systems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Dynamic hierarchical database architecture for location management in PCS networks
IEEE/ACM Transactions on Networking (TON)
Per-user profile replication in mobile environments: algorithms, analysis, and simulation results
Mobile Networks and Applications
Efficient and flexible location management techniques for wireless communication systems
Wireless Networks - Special issue: mobile computing and networking: selected papers from MobiCom '96
Analysis of mobile-assisted adaptive location management strategy
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Mobile users: to update or not to update?
Wireless Networks
Mobile user location update and paging under delay constraints
Wireless Networks
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Minimization of Communication Cost Through Caching in Mobile Environments
IEEE Transactions on Parallel and Distributed Systems
An efficient mobility management strategy for personal communication systems
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Better algorithms for unfair metrical task systems and applications
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On finding optimal registrations in presence of overlapping registration areas
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
The lookahead strategy for distance-based location tracking in wireless cellular networks
ACM SIGMOBILE Mobile Computing and Communications Review
Approximating a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
On Dynamically Adapting Registration Areas to User Mobility Patterns in PCS Networks
ICPP '99 Proceedings of the 1999 International Workshops on Parallel Processing
Modified tree structure for location management in mobile environments
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
IEEE Transactions on Mobile Computing
| Hi-index | 0.00 |
We describe a study of optimization techniques which have been proposed in the literature for registration area based location management from the perspective of optimal on-line algorithms. We show that most of these optimization techniques such as forwarding pointers and overlapped registration areas can be modeled using metrical task systems. Some of these models are simple while others are somewhat intricate. These representations directly imply the applicability of existing results on metrical task systems to algorithm design for location management. However, this also means that general lower bounds known for online metrical task systems carry over to our formulations of location management. We also discuss some restricted models in which much better (and simpler) algorithms are possible.