research-article

Efficient distributed source detection with limited bandwidth

Authors:

Christoph Lenzen,

David PelegAuthors Info & Claims

PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing

Pages 375 - 382

https://doi.org/10.1145/2484239.2484262

Published: 22 July 2013 Publication History

Abstract

Given a simple graph G=(V,E) and a set of sources S ⊆ V, denote for each node ν ε V by L_ν^(∞) the lexicographically ordered list of distance/source pairs (d(s,v),s), where s ∈ S. For integers d,k ∈ N∪{∞}, we consider the source detection, or (S,d,k)-detection task, requiring each node v to learn the first k entries of L_ν^(∞) (if for all of them d(s,v) ≤ d) or all entries (d(s,v),s) ∈ L_ν^(∞) satisfying that d(s,v) ≤ d (otherwise). Solutions to this problem provide natural generalizations of concurrent breadth-first search (BFS) tree constructions. For example, the special case of k=∞ requires each source s ∈ S to build a complete BFS tree rooted at s, whereas the special case of d=∞ and S=V requires constructing a partial BFS tree comprising at least k nodes from every node in V.

In this work, we give a simple, near-optimal solution for the source detection task in the CONGEST model, where messages contain at most O(log n) bits, running in d+k rounds. We demonstrate its utility for various routing problems, exact and approximate diameter computation, and spanner construction. For those problems, we obtain algorithms in the CONGEST model that are faster and in some cases much simpler than previous solutions.

References

[1]

D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing, 28(4):1167--1181, 1999.

Digital Library

[2]

P. Almeida, C. Baquero, and A. Cunha. Fast distributed computation of distances in networks. In Proc. 51st Conf. on Decision and Control (CDC), pages 5215--5220, 2012.

[3]

J. Antonio, G. Huang, and W. Tsai. A fast distributed shortest path algorithm for a class of hierarchically clustered data networks. IEEE Transactions on Computers, 41:710--724, 1992.

Digital Library

[4]

S. Baswana and T. Kavitha. Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In Proc. 47th Symp. on Foundations of Computer Science (FOCS), pages 591--602, 2006.

Digital Library

[5]

S. Baswana, T. Kavitha, K. Mehlhorn, and S. Pettie. Additive spanners and (α, β)-spanners. ACM Transactions on Algorithms, 7(1), 2010. Article No. 5.

Digital Library

[6]

S. Baswana and S. Sen. Approximate distance oracles for unweighted graphs in expected O(n²) time. ACM Transactions on Algorithms, 2:557--577, 2006.

Digital Library

[7]

S. Chechik. New additive spanners. In Proc. 24th Symp. on Discrete Algorithms (SODA), 2013.

[8]

S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Petricola. Partially dynamic algorithms for distributed shortest paths and their experimental evaluation. Journal on Computers, 2:16--26, 2007.

[9]

D. Dor, S. Halperin, and U. Zwick. All-pairs almost shortest paths. SIAM Journal on Computing, 29(5):1740--1759, 2000.

Digital Library

[10]

M. Elkin. Computing almost shortest paths. ACM Transactions on Algorithms, 1:283--323, 2005.

Digital Library

[11]

M. Elkin and D. Peleg. (1 ε, β)-spanner constructions for general graphs. SIAM Journal on Computing, 33(3):608--631, 2004.

Digital Library

[12]

S. Frischknecht, S. Holzer, and R. Wattenhofer. Networks cannot compute their diameter in sublinear time. In Proc. 23rd Symp. on Discrete Algorithms (SODA), pages 1150--1162, 2007.

Digital Library

[13]

C. Gavoille and D. Peleg. Compact and localized distributed data structures. Distributed Computing, 16:111--120, 2003.

Digital Library

[14]

S. Haldar. An 'all pairs shortest paths' distributed algorithm using 2n² messages. Journal of Algorithms, 24(1):20--36, 1997.

Digital Library

[15]

S. Holzer and R. Wattenhofer. Optimal distributed all pairs shortest paths and applications. In Proc. 31st Symp. on the Principles of Distributed Computing (PODC), pages 355--364, 2012.

Digital Library

[16]

S. Kanchi and D. Vineyard. An optimal distributed algorithm for all-pairs shortest-path. International Journal Information Theories and Applications, 11(2):141--146, 2004.

[17]

T. Kavitha. Faster algorithms for all-pairs small stretch distances in weighted graphs. In Proc. 27th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 328--339, 2007.

Digital Library

[18]

B. Patt-Shamir and C. Lenzen. Fast Routing Table Construction Using Small Messages {Extended Abstract}. In Proc. 45th Symposium on the Theory of Computing (STOC), 2013. Full version at http://arxiv.org/abs/1210.5774.

Digital Library

[19]

D. Peleg. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.

Digital Library

[20]

D. Peleg, L. Roditty, and E. Tal. Distributed algorithms for network diameter and girth. In Proc. 39th Colloquium on Automata, Languages, and Programming (ICALP), pages 660--672, 2012.

Digital Library

[21]

L. Roditty, M. Thorup, and U. Zwick. Deterministic constructions of approximate distance oracles and spanners. In Proc. 32nd Colloquium on Automata, Languages, and Programming (ICALP), pages 261--272, 2005.

Digital Library

[22]

L. Roditty and V. Williams. Approximating the diameter of a graph. CoRR, abs/1207.3622, 2012.

[23]

A. Segall. Distributed network protocols. IEEE Transactions on Information Theory, 29:23--35, 1983.

Digital Library

[24]

M. Thorup and U. Zwick. Approximate distance oracles. Journal of the ACM, 52:1--24, 2005.

Digital Library

[25]

M. Thorup and U. Zwick. Spanners and emulators with sublinear distance errors. In Proc. 17th Symp. on Discrete Algorithms (SODA), pages 802--809, 2006.

Digital Library

Cited By

KITAMURA NIZUMI T(2022)A Subquadratic-Time Distributed Algorithm for Exact Maximum MatchingIEICE Transactions on Information and Systems10.1587/transinf.2021EDP7083E105.D:3(634-645)Online publication date: 1-Mar-2022
https://doi.org/10.1587/transinf.2021EDP7083
Dory MParter M(2022)Exponentially Faster Shortest Paths in the Congested CliqueJournal of the ACM10.1145/352721369:4(1-42)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1145/3527213
Izumi TKitamura NNaruse TSchwartzman GAgrawal KLee I(2022)Fully Polynomial-Time Distributed Computation in Low-Treewidth GraphsProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538590(11-22)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538590
Show More Cited By

Index Terms

Efficient distributed source detection with limited bandwidth
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
      2. Paths and connectivity problems

Recommendations

Almost-Optimal Sublinear Additive Spanners
STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing

Given an undirected unweighted graph G = (V, E) on n vertices and m edges, a subgraph H⊆ G is a spanner of G with stretch function f: ℝ₊ → ℝ₊, iff for every pair s, t of vertices in V, dist_H(s, t)≤ f(dist_G(s, t)). When f(d) = d + o(d), H is called a ...
Near-Optimal Distributed Routing with Low Memory
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing

Distributed \em routing is one of the most central and fundamental problems in the area of Distributed Graph Algorithms. It was extensively studied for almost thirty years. Nevertheless, the currently existing solutions for this problem require either ...
Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension

We consider compact routing schemes in networks of low doubling dimension, where the doubling dimension is the least value α such that any ball in the network can be covered by at most 2^α balls of half radius. There are two variants of routing-scheme ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing

July 2013

422 pages

ISBN:9781450320658

DOI:10.1145/2484239

General Chair:
Panagiota Fatourou
FORTH ICS & University of Crete, Greece
,
Program Chair:
Gadi Taubenfeld
IDC, Israel

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 July 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PODC '13

Sponsor:

PODC '13: ACM Symposium on Principles of Distributed Computing

July 22 - 24, 2013

Québec, Montréal, Canada

Acceptance Rates

PODC '13 Paper Acceptance Rate 37 of 145 submissions, 26%;

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

49
Total Citations
View Citations
358
Total Downloads

Downloads (Last 12 months)14
Downloads (Last 6 weeks)1

Reflects downloads up to 28 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

KITAMURA NIZUMI T(2022)A Subquadratic-Time Distributed Algorithm for Exact Maximum MatchingIEICE Transactions on Information and Systems10.1587/transinf.2021EDP7083E105.D:3(634-645)Online publication date: 1-Mar-2022
https://doi.org/10.1587/transinf.2021EDP7083
Dory MParter M(2022)Exponentially Faster Shortest Paths in the Congested CliqueJournal of the ACM10.1145/352721369:4(1-42)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1145/3527213
Izumi TKitamura NNaruse TSchwartzman GAgrawal KLee I(2022)Fully Polynomial-Time Distributed Computation in Low-Treewidth GraphsProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538590(11-22)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538590
Abboud ACensor-Hillel KKhoury SPaz A(2021)Smaller Cuts, Higher Lower BoundsACM Transactions on Algorithms10.1145/346983417:4(1-40)Online publication date: 4-Oct-2021
https://dl.acm.org/doi/10.1145/3469834
Elkin MMatar SMiller ACensor-Hillel K(2021)Ultra-Sparse Near-Additive EmulatorsProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467926(235-246)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467926
Haeupler BWajc DZuzic GKhuller SVassilevska Williams V(2021)Universally-optimal distributed algorithms for known topologiesProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451081(1166-1179)Online publication date: 15-Jun-2021
https://dl.acm.org/doi/10.1145/3406325.3451081
Bernstein ANanongkai D(2021)Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear TimeSIAM Journal on Computing10.1137/20M131278252:2(STOC19-112-STOC19-127)Online publication date: 23-Nov-2021
https://doi.org/10.1137/20M1312782
Saikia PKarmakar S(2021)Improved distributed approximation for Steiner tree in the CONGEST modelJournal of Parallel and Distributed Computing10.1016/j.jpdc.2021.08.004158:C(196-212)Online publication date: 1-Dec-2021
https://dl.acm.org/doi/10.1016/j.jpdc.2021.08.004
Hua QQian LYu DShi XJin H(2021)A nearly optimal distributed algorithm for computing the weighted girthScience China Information Sciences10.1007/s11432-020-2931-x64:11Online publication date: 14-May-2021
https://doi.org/10.1007/s11432-020-2931-x
Chechik SMukhtar D(2021)Single-source shortest paths in the CONGEST model with improved boundsDistributed Computing10.1007/s00446-021-00412-835:4(357-374)Online publication date: 27-Nov-2021
https://doi.org/10.1007/s00446-021-00412-8
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents