Faster rumor spreading: Breaking the log n barrier

Chen Avin, Robert Elsässer

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


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 assumptions 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, addressoblivious and robust algorithm that uses push&pull with pointer jumping to spread a rumor to all nodes in only O(√log n) rounds, w.h.p. This algorithm can also cope with F = o(n/2 √log n) node failures, in which case all but O(F) nodes become informed within O(√log n) rounds, w.h.p.

Original languageEnglish
Title of host publicationDistributed Computing - 27th International Symposium, DISC 2013, Proceedings
Number of pages15
StatePublished - 1 Dec 2013
Event27th International Symposium on Distributed Computing, DISC 2013 - Jerusalem, Israel
Duration: 14 Oct 201318 Oct 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8205 LNCS


Conference27th International Symposium on Distributed Computing, DISC 2013

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


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

Cite this