NDLI: Rumor Spreading with No Dependence on Conductance

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Kelner, Jonathan Maymounkov, Petar Haeupler, Bernhard Censor-Hillel, Keren
Copyright Year	2017
Abstract	In this paper, we study how a collection of interconnected nodes can efficiently perform a global computation in the $\mathcal{GOSSIP}$ model of communication. In this model nodes do not know the global topology of the network and may only initiate contact with a single neighbor in each round. This contrasts with the much less restrictive $\mathcal{LOCAL}$ model, where a node may simultaneously communicate with all of its neighbors in a single round. A basic question in this setting is how many rounds of communication are required for the information dissemination problem, in which each node has some piece of information and is required to collect all others. In the $\mathcal{LOCAL}$ model this is quite simple: each node broadcasts all of its information in each round, and the number of rounds required will be equal to the diameter of the underlying communication graph. In the $\mathcal{GOSSIP}$ model, each node must independently choose a single neighbor to contact, and the lack of global information makes it difficult to make any sort of principled choice. As such, researchers have focused on the uniform gossip algorithm, in which each node independently selects a neighbor uniformly at random. When the graph is well-connected, this works quite well. In a string of beautiful papers, researchers proved a sequence of successively stronger bounds on the number of rounds required in terms of the conductance $\phi$ and graph size $n$, culminating in a bound of $\Theta(\phi^{-1} \log n)$. In this paper, we give the first protocol that works efficiently on any topology. In particular we give an algorithm that solves the information dissemination problem in at most $O(D+\text{polylog}{(n)})$ rounds in a network of diameter $D$, with no dependence on the conductance. This is at most an additive polylogarithmic factor from the trivial lower bound of $D$. In fact, we prove that something stronger is true: any algorithm that requires $T$ rounds in the $\mathcal{LOCAL}$ model can be simulated in $O(T +\mathrm{polylog}(n))$ rounds in the $\mathcal{GOSSIP}$ model. We thus prove that these two models of distributed computation are equivalent up to an additive polylogarithmic term.
Sponsorship	Division of Computing and Communication Foundations. United States - Israel Binational Science Foundation. Israel Science Foundation
Starting Page	58
Ending Page	79
Page Count	22
File Format	PDF
ISSN	00975397
DOI	10.1137/14099992X
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	1 (Special Section on the Fifty-Fifth Annual ACM Symposium on Foundations of Computer Science (FOCS 2014))
Volume Number	46
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2017-01-31
Access Restriction	Subscribed
Subject Keyword	sparse spanners information spreading local model conductance decomposition gossip model Distributed algorithms
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance

Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance (2012)

Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance (2012).

Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance

Simple, Fast and Deterministic Gossip and Rumor Spreading

Simple, Fast and Deterministic Gossip and Rumor Spreading

Fast Information Spreading in Graphs with Large Weak Conductance

On the Push&Pull Protocol for Rumor Spreading

Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading

Rumor Spreading with No Dependence on Conductance

Similar Documents

Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance

Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance (2012)

Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance (2012).

Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance

Simple, Fast and Deterministic Gossip and Rumor Spreading

Simple, Fast and Deterministic Gossip and Rumor Spreading

Fast Information Spreading in Graphs with Large Weak Conductance

On the Push&Pull Protocol for Rumor Spreading

Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading

Rumor Spreading with No Dependence on Conductance