Distributed approximation algorithms for weighted shortest paths

A distributed network is modeled by a graph having n nodes (processors) and diameter D. We study the time complexity of approximating weighted (undirected) shortest paths on distributed networks with a O (log n) bandwidth restriction on edges (the standard synchronous CONGEST model). The question whether approximation algorithms help speed up the shortest paths and distance computation (more precisely distance computation) was raised since at least 2004 by Elkin (SIGACT News 2004). The unweighted case of this problem is well-understood while its weighted counterpart is fundamental problem in the area of distributed approximation algorithms and remains widely open. We present new algorithms for computing both single-source shortest paths (SSSP) and all-pairs shortest paths (APSP) in the weighted case. Our main result is an algorithm for SSSP. Previous results are the classic O(n)-time Bellman-Ford algorithm and an Õ(n1/2+1/2k + D)-time (8k⌈log(k + 1)⌉ --1)-approximation algorithm, for any integer k ≥ 1, which follows from the result of Lenzen and Patt-Shamir (STOC 2013). (Note that Lenzen and Patt-Shamir in fact solve a harder problem, and we use Õ(·) to hide the O(poly log n) term.) We present an Õ (n1/2D1/4 + D)-time (1 + o(1))-approximation algorithm for SSSP. This algorithm is sublinear-time as long as D is sublinear, thus yielding a sublinear-time algorithm with almost optimal solution. When D is small, our running time matches the lower bound of Ω(n1/2 + D) by Das Sarma et al. (SICOMP 2012), which holds even when D=Θ(log n), up to a poly log n factor. As a by-product of our technique, we obtain a simple Õ (n)-time (1+ o(1))-approximation algorithm for APSP, improving the previous Õ(n)-time O(1)-approximation algorithm following from the results of Lenzen and Patt-Shamir. We also prove a matching lower bound. Our techniques also yield an Õ(n1/2) time algorithm on fully-connected networks, which guarantees an exact solution for SSSP and a (2+ o(1))-approximate solution for APSP. All our algorithms rely on two new simple tools: light-weight algorithm for bounded-hop SSSP and shortest-path diameter reduction via shortcuts. These tools might be of an independent interest and useful in designing other distributed algorithms.

[1]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[2]  S. Haldar.  An 'All Pairs Shortest Paths' Distributed Algorithm Using 2n² Messages , 1997, J. Algorithms.

[3]  Nicola Santoro.  Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing) , 2006 .

[4]  Dahlia Malkhi,et al.  Efficient distributed approximation algorithms via probabilistic tree embeddings , 2008, PODC '08.

[5]  David Pritchard,et al.  Fast computation of small cuts via cycle space sampling , 2007, TALG.

[6]  Michael Elkin,et al.  Efficient algorithms for constructing (1+∊,β)-spanners in the distributed and streaming models , 2006, Distributed Computing.

[7]  Hartmut Klauck,et al.  Quantum Distributed Network Computing: Lower Bounds and Techniques , 2012, ArXiv.

[8]  Mikkel Thorup,et al.  Approximate distance oracles , 2001, JACM.

[9]  Boaz Patt-Shamir,et al.  Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds , 2005, SIAM J. Comput..

[10]  Boaz Patt-Shamir,et al.  Fast routing table construction using small messages: extended abstract , 2012, STOC '13.

[11]  Christian Sommer,et al.  Shortest-path queries in static networks , 2014, ACM Comput. Surv..

[12]  Michael Elkin,et al.  Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models , 2004, PODC '04.

[13]  David Peleg,et al.  A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction , 2000, SIAM J. Comput..

[14]  Sandeep Sen,et al.  A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs , 2007, Random Struct. Algorithms.

[15]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[16]  Ramakrishna Thurimella.  Sub-Linear Distributed Algorithms for Sparse Certificates and Biconnected Components , 1997, J. Algorithms.

[17]  Michael Dinitz,et al.  Efficient computation of distance sketches in distributed networks , 2011, SPAA '12.

[18]  Fabian Kuhn,et al.  Distributed Minimum Cut Approximation , 2013, DISC.

[19]  SommerChristian.  Shortest-path queries in static networks , 2014 .

[20]  Shay Kutten,et al.  Notions of Connectivity in Overlay Networks , 2012, SIROCCO.

[21]  Edith Cohen,et al.  Polylog-time and near-linear work approximation scheme for undirected shortest paths , 1994, STOC '94.

[22]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[23]  John K. Antonio,et al.  A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Networks , 1992, IEEE Trans. Computers.

[24]  Roger Wattenhofer,et al.  Optimal distributed all pairs shortest paths and applications , 2012, PODC '12.

[25]  Philip N. Klein,et al.  A parallel randomized approximation scheme for shortest paths , 1992, STOC '92.

[26]  Sartaj Sahni,et al.  Handbook of Data Structures and Applications , 2004 .

[27]  Michael Elkin.  An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem , 2006, SIAM J. Comput..

[28]  Prasad Tetali,et al.  Distributed Random Walks , 2013, JACM.

[29]  Boaz Patt-Shamir,et al.  The round complexity of distributed sorting: extended abstract , 2011, PODC '11.

[30]  David Peleg,et al.  Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification , 2013, Theory of Computing Systems.

[31]  Andrew Berns,et al.  Super-Fast Distributed Algorithms for Metric Facility Location , 2012, ICALP.

[32]  A. Holevo.  Bounds for the quantity of information transmitted by a quantum communication channel , 1973 .

[33]  Aaron Bernstein.  Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs , 2016, SIAM J. Comput..

[34]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[35]  Christoph Lenzen,et al.  "Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract) , 2012, DISC.

[36]  Bruce M. Maggs,et al.  Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..

[37]  Nicola Santoro,et al.  Design and analysis of distributed algorithms , 2006, Wiley series on parallel and distributed computing.

[38]  Aaron Bernstein.  Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract] , 2013, STOC '13.

[39]  L. R. Ford,et al.  NETWORK FLOW THEORY , 1956 .

[40]  Maleq Khan,et al.  A fast distributed approximation algorithm for minimum spanning trees , 2007, Distributed Computing.

[41]  D. Knuth,et al.  Mathematics for the Analysis of Algorithms , 1999 .

[42]  Roger Wattenhofer,et al.  Networks cannot compute their diameter in sublinear time , 2012, SODA.

[43]  Boaz Patt-Shamir,et al.  Distributed MST for constant diameter graphs , 2001, PODC '01.

[44]  Christoph Lenzen,et al.  Optimal deterministic routing and sorting on the congested clique , 2012, PODC '13.

[45]  Shay Kutten,et al.  Fast Distributed Construction of Small k-Dominating Sets and Applications , 1998, J. Algorithms.

[46]  Boaz Patt-Shamir,et al.  Distributed approximate matching , 2007, PODC '07.

[47]  Jian Zhang,et al.  Efficient algorithms for constructing (1+, varepsilon;, beta)-spanners in the distributed and streaming models. , 2004, PODC 2004.

[48]  Danupon Nanongkai.  Brief announcement: almost-tight approximation distributed algorithm for minimum cut , 2014, PODC '14.

[49]  Prabhakar Raghavan,et al.  Provably good routing in graphs: regular arrays , 1985, STOC '85.

[50]  Yehuda Afek,et al.  Sparser: A Paradigm for Running Distributed Algorithms , 1992, J. Algorithms.

[51]  Mihalis Yannakakis,et al.  High-probability parallel transitive closure algorithms , 1990, SPAA '90.

[52]  Seth Pettie.  Distributed algorithms for ultrasparse spanners and linear size skeletons , 2008, PODC '08.

[53]  Michael Elkin,et al.  Computing almost shortest paths , 2001, TALG.

[54]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[55]  John Augustine,et al.  Towards robust and efficient computation in dynamic peer-to-peer networks , 2011, SODA.

[56]  Stephan Holzer.  Distance computation, information dissemination, and wireless capacity in networks , 2014 .

[57]  I. Rhodes,et al.  Some shortest path algorithms with decentralized information and communication requirements , 1982 .

[58]  David Peleg,et al.  Distributed Algorithms for Network Diameter and Girth , 2012, ICALP.

[59]  Maleq Khan,et al.  A Fast Distributed Approximation Algorithm for Minimum Spanning Trees , 2006, DISC.

[60]  Michael Elkin,et al.  Distributed approximation: a survey , 2004, SIGA.