TY - GEN

T1 - Fast routing table construction using small messages

AU - Lenzen, Christoph

AU - Patt-Shamir, Boaz

PY - 2013

Y1 - 2013

N2 - We describe a distributed randomized algorithm to construct routing tables. Given 0 < ε ≤ 1/2, the algorithm runs in time Õ(n 1/2+ε + HD), where n is the number of nodes and HD denotes the diameter of the network in hops (i.e., as if the network is unweighted). The weighted length of the produced routes is at most O(ε-1 log ε-1) times the optimal weighted length. This is the first algorithm to break the Ω(n) complexity barrier for computing weighted shortest paths even for a single source. Moreover, the algorithm nearly meets the Ω̃(n1/2 + HD) lower bound for distributed computation of routing tables and approximate distances (with optimality, up to polylog factors, for ε = 1/ log n). The presented techniques have many applications, including improved distributed approximation algorithms for Generalized Steiner Forest, all-pairs distance estimation, and estimation of the weighted diameter.

AB - We describe a distributed randomized algorithm to construct routing tables. Given 0 < ε ≤ 1/2, the algorithm runs in time Õ(n 1/2+ε + HD), where n is the number of nodes and HD denotes the diameter of the network in hops (i.e., as if the network is unweighted). The weighted length of the produced routes is at most O(ε-1 log ε-1) times the optimal weighted length. This is the first algorithm to break the Ω(n) complexity barrier for computing weighted shortest paths even for a single source. Moreover, the algorithm nearly meets the Ω̃(n1/2 + HD) lower bound for distributed computation of routing tables and approximate distances (with optimality, up to polylog factors, for ε = 1/ log n). The presented techniques have many applications, including improved distributed approximation algorithms for Generalized Steiner Forest, all-pairs distance estimation, and estimation of the weighted diameter.

KW - Approximate shortest paths

KW - Routing

KW - Small messages

UR - http://www.scopus.com/inward/record.url?scp=84879820138&partnerID=8YFLogxK

U2 - https://doi.org/10.1145/2488608.2488656

DO - https://doi.org/10.1145/2488608.2488656

M3 - منشور من مؤتمر

SN - 9781450320290

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 381

EP - 390

BT - STOC 2013 - Proceedings of the 2013 ACM Symposium on Theory of Computing

T2 - 45th Annual ACM Symposium on Theory of Computing, STOC 2013

Y2 - 1 June 2013 through 4 June 2013

ER -