Fast Broadcast in Highly Connected Networks

Shashwat Chandra, Yi Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We revisit the classic broadcast problem, wherein we have k messages, each composed of O(log n) bits, distributed arbitrarily across a network. The objective is to broadcast these messages to all nodes in the network. In the distributed CONGEST model, a textbook algorithm solves this problem in O(D+k) rounds, where D is the diameter of the graph. While the O(D) term in the round complexity is unavoidable - -given that ω(D) rounds are necessary to solve broadcast in any graph - -it remains unclear whether the O(k) term is needed in all graphs. In cases where the minimum cut size is one, simply transmitting messages from one side of the cut to the other would require ω(k) rounds. However, if the size of the minimum cut is larger, it may be possible to develop faster algorithms. This motivates the exploration of the broadcast problem in networks with high edge connectivity. In this work, we present a simple randomized distributed algorithm for performing k-message broadcast in O(((n+k)/λ)log n) rounds in any n-node simple graph with edge connectivity λ. When k = ω(n), our algorithm is universally optimal, up to an O(log n) factor, as its complexity nearly matches an information-theoretic ω(k/λ) lower bound that applies to all graphs, even when the network topology is known to the algorithm. The setting k = ω(n) is particularly interesting because several fundamental problems can be reduced to broadcasting ω(n) messages. Our broadcast algorithm finds several applications in distributed computing, enabling O(1)-approximation for all distances and (1+ϵ)-approximation for all cut sizes in ∼O(n/λ) rounds.

Original languageEnglish
Title of host publicationSPAA 2024 - Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures
PublisherAssociation for Computing Machinery
Number of pages13
ISBN (Electronic)9798400704161
StatePublished - 17 Jun 2024
Event36th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2024 - Nantes, France
Duration: 17 Jun 202421 Jun 2024

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures
ISSN (Print)1548-6109


Conference36th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2024

Bibliographical note

Publisher Copyright:
© 2024 Owner/Author.


  • all pairs shortest paths
  • congest model
  • tree packing

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture


Dive into the research topics of 'Fast Broadcast in Highly Connected Networks'. Together they form a unique fingerprint.

Cite this