Abstract. 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
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, address-oblivious and robust algorithm that uses push&pull with pointer jumping to spread a rumor to all nodes in only
rounds, w.h.p. This algorithm can also cope with
node failures, in which case all but
nodes become informed within
rounds, w.h.p.
Guest: Chen Avin
Host: Shantanu Das
Podcast: Play in new window | Download