Efficient distributed computation of distance sketches in networks
| Autor: | Michael Dinitz, Atish Das Sarma, Gopal Pandurangan |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Theoretical computer science
Computer Networks and Communications Computer science Load balancing (computing) Security token Telecommunications network Oracle Theoretical Computer Science Computational Theory and Mathematics Hardware and Architecture Distributed algorithm Theory of computation Graph (abstract data type) Pairwise comparison |
| Zdroj: | Distributed Computing. 28:309-320 |
| ISSN: | 1432-0452 0178-2770 |
| Popis: | Distance computation (e.g., computing shortest paths) is one of the most fundamental primitives used in communication networks. The cost of effectively and accurately computing pairwise network distances can become prohibitive in large-scale networks such as the Internet and Peer-to-Peer (P2P) networks. The idea behind distance sketches is to preprocess the graph and store a small amount of information (called as sketch or distance label) such that whenever a query for any pairwise distance is issued, the distance can be well approximated (i.e., with small stretch) very quickly in an online fashion. Specifically, the pre-processing (usually) involves storing this sketch with each node, such that at query time only the sketches of the concerned nodes need to be looked up to compute the approximate distance. In this paper, we present the first theoretical study of distance sketches derived from distance oracles in a distributed network. We first present a fast distributed algorithm for computing approximate distance sketches, based on a distributed implementation of the distance oracle scheme of (Thorup and Zwick, J ACM 52(1):1---24, 2005). We also show how to modify this basic construction to achieve different tradeoffs between the number of pairs for which the distance estimate is accurate, the size of the sketches, and the time and message complexity necessary to compute them. These tradeoffs can then be combined to give an efficient construction of small sketches with provable average-case as well as worst-case performance. Our algorithms use only small-sized messages and hence are suitable for bandwidth-constrained networks, and can be used in various networking applications such as topology discovery and construction, token management, load balancing, monitoring overlays, and several other problems in distributed algorithms. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|