Online tracking of mobile users

DOI10.1145/210118.210132zbMath0885.68017OpenAlexW1996879666MaRDI QIDQ4369889

Baruch Awerbuch, David Peleg

Publication date: 28 January 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/210118.210132

zbMATH Keywords

distributed directory server

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (14)

Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling ⋮ On-line generalized Steiner problem ⋮ Distributed transactional memory for metric-space networks ⋮ Sublinear fully distributed partition with applications ⋮ Competitive distributed file allocation. ⋮ Dynamic Routing and Location Services in Metrics of Low Doubling Dimension ⋮ Information fields navigation with piece-wise polynomial approximation for high-performance OFDM in WSNs ⋮ Optimal nearest neighbor queries in sensor networks ⋮ Space-efficient path-reporting approximate distance oracles ⋮ Sparse covers for planar graphs and graphs that exclude a fixed minor ⋮ A tight bound on approximating arbitrary metrics by tree metrics ⋮ Simple and efficient network decomposition and synchronization ⋮ Mobile data and transaction management ⋮ An analysis framework for distributed hierarchical directories

This page was built for publication: Online tracking of mobile users