Breaking the log n barrier on rumor spreading

Chen Avin, Robert Elsässer

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


O(log n) rounds has been a well known upper bound for rumor spreading using push&pull in the random phone call model (i.e., uniform gossip in the complete graph). A matching lower bound of Ω(log n) is also known for this special case. Under the assumption of this model and with a natural addition that nodes can call a partner once they learn its address (e.g., its IP address) we present a new distributed, address-oblivious and robust algorithm that uses push&pull with pointer jumping to spread a rumor to all nodes in only O(logn) rounds, w.h.p. This algorithm can also cope with F=O(n/2logn) node failures, in which case all but O(F) nodes become informed within O(logn) rounds, w.h.p.

Original languageEnglish
Pages (from-to)503-513
Number of pages11
JournalDistributed Computing
Issue number6
StatePublished - 1 Nov 2018


  • Gossip algorithms
  • Push & pull
  • Random phone call
  • Rumor spreading

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computational Theory and Mathematics


Dive into the research topics of 'Breaking the log n barrier on rumor spreading'. Together they form a unique fingerprint.

Cite this