On triangulation of simple networks

Network triangulation is a method for estimating distances betweennodes in the network, by letting every node measure its distanceto a few beacon nodes, and deducing the distance between every two nodes x,y by using their measurements to their common beaconsand applying the triangle inequality. Kleinberg, Slivkins and Wexler [FOCS 2004] initiated a theoretical study of triangulation in metric spaces, and Slivkins [PODC 2005] subsequently showed that metrics of bounded doubling dimension admit a triangulation thatapproximates arbitrarily well all pairwise distances using only O(log n) beacons per point, where n is the number of points in the network. He then asked whether this term is necessary (for doubling metrics). We provide the first lower bounds on the number of beacons required for a triangulation in some specific simple networks. In particular, these bounds (i) answer Slivkins' question positively, even for one-dimensional metrics, and (ii) prove that, up to constants, Slivkins' triangulation achieves an optimal number of beacons (as a function of the approximation guarantee and the doubling dimension).

[1]  Aleksandrs Slivkins,et al.  Distributed approaches to triangulation and embedding , 2005, SODA '05.

[2]  Jon M. Kleinberg,et al.  Triangulation and embedding using small sets of beacons , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[3]  Robert Krauthgamer,et al.  Measured Descent: A New Embedding Method for Finite Metrics , 2004, FOCS.

[4]  Robert Krauthgamer,et al.  Navigating nets: simple algorithms for proximity search , 2004, SODA '04.

[5]  Paul Francis,et al.  IDMaps: a global internet host distance estimation service , 2001, TNET.

[6]  Andrew V. Goldberg,et al.  Routing in Networks with Low Doubling Dimension , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[7]  D. Peleg Proximity-preserving labeling schemes , 2000, J. Graph Theory.

[8]  Aleksandrs Slivkins Distance estimation and object location via rings of neighbors , 2006, Distributed Computing.

[9]  Michael F. Schwartz,et al.  Locating nearby copies of replicated Internet servers , 1995, SIGCOMM '95.

[10]  Robert Krauthgamer,et al.  Algorithms on negatively curved spaces , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[11]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[13]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1999, Theory of Computing Systems.

[14]  Sariel Har-Peled,et al.  Fast construction of nets in low dimensional metrics, and their applications , 2004, SCG.

[15]  David R. Karger,et al.  Finding nearest neighbors in growth-restricted metrics , 2002, STOC '02.

[16]  Olivier Ly,et al.  Distance Labeling in Hyperbolic Graphs , 2005, ISAAC.

[17]  Kunal Talwar,et al.  Bypassing the embedding: algorithms for low dimensional metrics , 2004, STOC '04.

[18]  Patrice Assouad Plongements lipschitziens dans ${\mathbb {R}}^n$ , 1983 .

[19]  P. Assouad Plongements lipschitziens dans Rn , 2003 .

[20]  Ran Raz,et al.  Distance labeling in graphs , 2001, SODA '01.

[21]  Robert Krauthgamer,et al.  Bounded geometries, fractals, and low-distortion embeddings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[22]  Cyril Gavoille,et al.  Approximate Distance Labeling Schemes , 2000, Electron. Notes Discret. Math..