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 - 10.1007/978-3-642-41527-2_15
DO - 10.1007/978-3-642-41527-2_15
M3 - Conference contribution
AN - SCOPUS:84893774563
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 -