Online tracking of mobile users
- 1 September 1995
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 42 (5) , 1021-1058
- https://doi.org/10.1145/210118.210132
Abstract
This paper deals with the problem of maintaining a distributed directory server, that enables us to keep track of mobile users in a distributed network. The paper introduces the graph-theoretic concept of regional matching , and demonstrates how finding a regional matching with certain parameters enables efficient tracking. The communication overhead of our tracking mechanism is within a polylogarithmic factor of the lower bound.Keywords
This publication has 12 references indexed in Scilit:
- Mobile users: To update or not to update?Wireless Networks, 1995
- Routing with Polynomial Communication-Space Trade-OffSIAM Journal on Discrete Mathematics, 1992
- An Optimal Synchronizer for the HypercubeSIAM Journal on Computing, 1989
- A trade-off between space and efficiency for routing tablesJournal of the ACM, 1989
- Graph spannersJournal of Graph Theory, 1989
- Distributed match-makingAlgorithmica, 1988
- Complexity of network synchronizationJournal of the ACM, 1985
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Resynch Procedures and a Fail-Safe Network ProtocolIEEE Transactions on Communications, 1979
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978