Approximation Algorithms for Broadcasting and Gossiping

doi:10.1006/jpdc.1997.1318

Journal of Parallel and Distributed Computing

Volume 43, Issue 1, 25 May 1997, Pages 47-55

https://doi.org/10.1006/jpdc.1997.1318 Get rights and content

Abstract

Broadcasting and gossiping are two basic communication patterns which commonly occur when programming parallel and distributed systems. This paper deals with approximation algorithms for solving these problems on arbitrary topologies. We present new strategies to derive efficient broadcasting and gossiping algorithms in any networks in the telephone model. Our objective is to minimize both round complexity and step complexity. Broadcasting strategies are based on the construction of edge-disjoint spanning trees. Gossiping strategies are based on on-line computation of matchings of maximum weight. Our approximation algorithms for broadcasting offer almost optimal complexity when the number of messages to be broadcast is large. We show that our approximation algorithm for gossiping performs optimally in many cases. We also show experimentally that it performs faster than the best-known handmade algorithms in some particular cases.

References (23)

P. Fraigniaud et al.
Methods and problems of communication in usual networks
Discrete Appl. Math.
(1994)
W. Knodel
New gossips and telephones
Discrete Math.
(1975)
L. Lovasz
On two minimax theorems in graph theory
J. Combin. Theory B
(1976)
M. Middendorf
Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
Inform. Process. Lett.
(1993)
J.-C. Bermond et al.
Broadcasting and NP-completeness
Graph Theory Nodes New York
(1992)
J.-C. Bermond, L. Gargano, A. Rescigno, U. Vaccaro, Optimal gossiping by short messages, Dipartimento di Informatica ed...
G. Cybenko et al.
Gossiping in minimum time
SIAM J. Comput.
(1992)
J. Edmonds
Edge-disjoint branchings, combinatorial algorithms
Combinatorial Algorithms 91–96
(1972)
A. Farley et al.
Gossiping in grid graphs
J. Combin. Inform. System Sci.
(1980)
U. Feige et al.
Randomized broadcast in networks
Lecture Notes in Computer Science
(1990)

P. Fraigniaud et al.

Disjoint spanning trees of small depth

Parallel Computing: Trends and Applications

(1994)

Cited by (34)

Rumor spreading with bounded in-degree
2020, Theoretical Computer Science
Citation Excerpt :
It is well known that computing an optimal schedule in the phone call model is NP-complete [14] and this even holds if the network graph is a planar three regular graph [25]. There are several papers that either prove approximations of optimal schedules, e.g., [26,11] or that try to solve the problem by a heuristic approach [21]. For a good summary on general information dissemination in communication networks we also refer to the book of Hromkovič et al. [19].
In the gossip-based model of communication for disseminating information in a network, in each time unit, every node u can contact a single random neighbor v but can possibly be contacted by many nodes.
In the present paper, we consider a restricted model where at each node only one incoming call can be answered in one time unit. We study the implied weaker version of the well-studied pull protocol, which we call restricted pull.
We prove an exponential separation of the rumor spreading time between two variants of the protocol (the answered call among a set of calls is chosen adversarially or uniformly at random). Further, we show that if the answered call is chosen randomly, the slowdown of restricted pull versus the classic pull protocol can w.h.p. be upper bounded by $O (ψ (G) \cdot \log n)$ , where $ψ (G) = \max_{{u, v} \in E} d (u) / d (v) \leq \frac{Δ}{δ}$ with Δ and δ being the largest and smallest degree of the network $G = (V, E)$ and $d (u)$ being the degree of u.
Broadcasting in weighted trees under the postal model
2016, Theoretical Computer Science
Given a weighted graph $G = (V, E)$ , the broadcasting problem is to find a broadcast center such that the maximum communication time from the center to all vertices is minimized. For this problem, Slater et al. [29] proposed an $O (n)$ -time algorithm in unweighted trees and Koh and Tcha [23] designed an $O (n \log n)$ -time algorithm in unweighted trees under the telephone model. In this paper, we strengthen the results of Slater et al. by showing an $O (n)$ -time algorithm in weighted trees under the postal model. The algorithm computes the set of broadcast centers, determines the broadcast time of the broadcast centers, and an optimal broadcast scheme from one of the centers to all vertices in the tree. We further show that the broadcast time of any vertex in the tree can also be determined in $O (n)$ time.
Optimizing social media message dissemination problem for emergency communication
2014, Computers and Industrial Engineering
Citation Excerpt :
Gossiping and broadcasting are two well-known problems in the communications and wireless networks domain. We provide Table 3 as a summary of the survey (Hedetniem, Hedetniem, & Liestman, 1988) and additional literature (Fraigniaud & Vial, 1997; Ravi, 1994) to illustrate the differences between such problems and SMMD. Furthermore, we use Table 3 to indicate how SMMD contributes to the current knowledge gap in communications and network optimization.
Social media is increasingly being used as a communication bridge between government, emergency responders and managers, and the general public in extreme events. Passing information through social media channels enables individuals to send and receive content in real-time and without limitation of location and geography. While the use of social media in extreme event situations has become prevalent, there is often little strategy involved in message dissemination and too little understanding of the effects that underlying online social networks have on message distribution. In this study, we introduce a formal model for social media message dissemination in social networks through time. Our proposed model includes emphasis on single and multiple message scenarios and examines key communication characteristics in the development of more intentional and targeted social messaging strategies. We present a detailed experimental design on randomly generated networks and real-world sub-networks of the Twitter social graph and discuss our findings. We also include a Tabu Search procedure for solving single-message problem and discuss its potential value for large-scale problems in real-world applications.
On the number of broadcast schemes in networks
2006, Information Processing Letters
Broadcasting is the process of spreading one piece of information among a group of individuals connected by an interconnection network. In this paper we give exact lower and upper bounds for the number of broadcast schemes in arbitrary networks. Also, we give the exact value for complete bipartite graphs and an upper bound for regular networks. Based on the counting method we describe a new random algorithm for broadcasting in networks.
An efficient heuristic for broadcasting in networks
2006, Journal of Parallel and Distributed Computing
In this paper, we present a heuristic for broadcasting in arbitrary networks. This heuristic generates optimal broadcast time for ring, tree and grid graphs when the originator is a corner vertex. In practice, the new heuristic outperforms the best known broadcast algorithms for three different network models. The time complexity of one round of the heuristic is $O (| E |)$ , where $| E |$ stand for the number of edges of the network.
Efficient trigger-broadcasting in heterogeneous clusters
2005, Journal of Parallel and Distributed Computing
Broadcasts in parallel computing environments are often used to trigger “personal” computations at the processors (or, nodes) that comprise the system. (The qualifier “personal” means that the triggered computations may differ in type and complexity at each node.) We present an algorithm for trigger-broadcasting in a node-heterogeneous cluster of workstations, which comes predictably close to minimizing the time for completing both the broadcast and the computations it triggers. The algorithm orchestrates its broadcast taking account of: the speeds of the cluster's constituent workstations, the speed of the cluster's network, and the complexities of the computations that the broadcast triggers. The algorithm is within a constant factor of optimal when the speeds of the cluster's workstations and of its network are independent of the number of workstations. The algorithm is exactly optimal when the cluster is homogeneous—no matter how diverse the “personal” computations are.

View all citing articles on Scopus

: R. Rustin, Ed.

¹: Both authors are supported by the research programs PRS and ANM of the CNRS

View full text

Research NoteApproximation Algorithms for Broadcasting and Gossiping

Abstract

Discrete Appl. Math.

Discrete Math.

J. Combin. Theory B

Inform. Process. Lett.

Broadcasting and NP-completeness

Graph Theory Nodes New York

Gossiping in minimum time

SIAM J. Comput.

Edge-disjoint branchings, combinatorial algorithms

Combinatorial Algorithms 91–96

Gossiping in grid graphs

J. Combin. Inform. System Sci.

Randomized broadcast in networks

Lecture Notes in Computer Science

Disjoint spanning trees of small depth

Parallel Computing: Trends and Applications

Research Note
Approximation Algorithms for Broadcasting and Gossiping