Faster rumor spreading: Breaking the log n barrier

Chen Avin; Robert Elsässer

doi:https://doi.org/10.1007/978-3-642-41527-2_15

Faster rumor spreading: Breaking the log n barrier

Chen Avin, Robert Elsässer

Department of Communication Systems Engineering

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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 language	English
Title of host publication	Distributed Computing - 27th International Symposium, DISC 2013, Proceedings
Pages	209-223
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-41527-2_15
State	Published - 1 Dec 2013
Event	27th International Symposium on Distributed Computing, DISC 2013 - Jerusalem, Israel Duration: 14 Oct 2013 → 18 Oct 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8205 LNCS

Conference

Conference	27th International Symposium on Distributed Computing, DISC 2013
Country/Territory	Israel
City	Jerusalem
Period	14/10/13 → 18/10/13

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

https://doi.org/10.1007/978-3-642-41527-2_15

Cite this

Avin, C., & Elsässer, R. (2013). Faster rumor spreading: Breaking the log n barrier. In Distributed Computing - 27th International Symposium, DISC 2013, Proceedings (pp. 209-223). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8205 LNCS). https://doi.org/10.1007/978-3-642-41527-2_15

@inproceedings{b09a510ecf7d4b52a1dd6941a55c5459,

title = "Faster rumor spreading: Breaking the log n barrier",

abstract = "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.",

author = "Chen Avin and Robert Els{\"a}sser",

note = "Funding Information: This work was partially supported by the Austrian Science Fund (FWF) under contract P25214-N23 “Analysis of Epidemic Processes and Algorithms in Large Networks”.; 27th International Symposium on Distributed Computing, DISC 2013 ; Conference date: 14-10-2013 Through 18-10-2013",

year = "2013",

month = dec,

day = "1",

doi = "https://doi.org/10.1007/978-3-642-41527-2_15",

language = "English",

isbn = "9783642415265",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "209--223",

booktitle = "Distributed Computing - 27th International Symposium, DISC 2013, Proceedings",

}

Avin, C & Elsässer, R 2013, Faster rumor spreading: Breaking the log n barrier. in Distributed Computing - 27th International Symposium, DISC 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8205 LNCS, pp. 209-223, 27th International Symposium on Distributed Computing, DISC 2013, Jerusalem, Israel, 14/10/13. https://doi.org/10.1007/978-3-642-41527-2_15

Faster rumor spreading: Breaking the log n barrier. / Avin, Chen; Elsässer, Robert.
Distributed Computing - 27th International Symposium, DISC 2013, Proceedings. 2013. p. 209-223 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8205 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Faster rumor spreading

T2 - 27th International Symposium on Distributed Computing, DISC 2013

AU - Avin, Chen

AU - Elsässer, Robert

N1 - Funding Information: This work was partially supported by the Austrian Science Fund (FWF) under contract P25214-N23 “Analysis of Epidemic Processes and Algorithms in Large Networks”.

PY - 2013/12/1

Y1 - 2013/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84893774563&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/978-3-642-41527-2_15

DO - https://doi.org/10.1007/978-3-642-41527-2_15

M3 - Conference contribution

SN - 9783642415265

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 209

EP - 223

BT - Distributed Computing - 27th International Symposium, DISC 2013, Proceedings

Y2 - 14 October 2013 through 18 October 2013

ER -

Faster rumor spreading: Breaking the log n barrier

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this