Remote spanners: what to know beyond neighbors - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Remote spanners: what to know beyond neighbors

(1) , (2)
1
2
Philippe Jacquet
Laurent Viennot

Abstract

Motivated by the fact that neighbors are generally known in practical routing algorithms, we introduce the notion of remote-spanner. Given an unweighted graph $G$, a sub-graph $H$ with vertex set $V(H)=V(G)$ is an \emph{$(\a,\b)$-remote-spanner} if for each pair of points $u$ and $v$ the distance between $u$ and $v$ in $H_u$, the graph $H$ augmented by all the edges between $u$ and its neighbors in $G$, is at most $\a$ times the distance between $u$ and $v$ in $G$ plus $\b$. We extend this definition to $k$-connected graphs by considering minimum length sum over $k$ disjoint paths as distance. We then say that an $(\a,\b)$-remote-spanner is \emph{$k$-connecting }. In this paper, we give distributed algorithms for computing $(1+\eps,1-2\eps)$-remote-spanners for any $\eps>0$, $k$-connecting $(1,0)$-remote-spanners for any $k\ge 1$ (yielding $(1,0)$-remote-spanners for $k=1$) and $2$-connecting $(2,-1)$-remote-spanners. All these algorithms run in constant time for any unweighted input graph. The number of edges obtained for $k$-connecting $(1,0)$-remote-spanner is within a logarithmic factor from optimal (compared to the best $k$-connecting $(1,0)$-remote-spanner of the input graph). Interestingly, sparse $(1,0)$-remote-spanners (i.e. preserving exact distances) with $O(n^4/3)$ edges exist in random unit disk graphs. The number of edges obtained for $(1+\eps,1-2\eps)$-remote-spanners and $2$-connecting $(2,-1)$-remote-spanners is linear if the input graph is the unit ball graph of a doubling metric (distances between nodes are unknown). Our methodology consists in characterizing remote-spanners as sub-graphs containing the union of small depth tree sub-graphs dominating nearby nodes. This leads to simple local distributed algorithms.
Fichier principal
Vignette du fichier
ipdps2009remote.pdf (166.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00471726 , version 1 (08-04-2010)

Identifiers

Cite

Philippe Jacquet, Laurent Viennot. Remote spanners: what to know beyond neighbors. 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), May 2009, Rome, Italy. pp.1--10, ⟨10.1109/IPDPS.2009.5161041⟩. ⟨inria-00471726⟩
133 View
163 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More