Distance estimation and object location via rings of neighbors
24th Annual ACM SIGACT-SIGOPS Symp. on Principles Of Distributed Computing (PODC) |
Published by Association for Computing Machinery, Inc.
Full version (appeared in the special issue of Distributed Computing: 19(4), pp. 313-333, March 2007).
We consider four problems on distance estimation and object location which share the commonﬂavor of capturing global information via informative node labels: low-stretch routing schemes , distance labeling , searchable small worlds , and triangulation-based distance estimation . Focusing on metrics of low doubling dimension, we approach these problems with a common technique called rings of neighbors, which refers to a sparse distributed data structure that underlies all our constructions. Apart from improving the previously known bounds for these problems, our contributions include extending Kleinberg’s small world model to doubling metrics, and a short proof of the main result in Chan et al. . Doubling dimension is a notion of dimensionality for general metrics that has recently become a useful algorithmic concept in the theoretical computer science literature.
Copyright © 2007 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or firstname.lastname@example.org. The definitive version of this paper can be found at ACM’s Digital Library --http://www.acm.org/dl/.