Brief Announcement: Rumor Spreading with Bounded In-Degree

Abstract : Random gossip (push and pull) is one of the most studied protocols for dis- seminating information in a network, e.g., [1, 3]. Classically, in each time unit, every node u is allowed to contact a single random neighbor v. If u knows the data (rumor) to be disseminated, node v learns it (known as push) and if node v knows the rumor, u learns it (known as pull). While in the classic gossip model, each node is only allowed to contact a single neighbor in each time unit, each node can possibly be successfully contacted by and thus interact with many neighboring nodes. As an extreme case, consider the behavior of random pull in a star network where a single center node is connected to n − 1 leaf nodes. In fact, all recent papers which study the time complexity of the random push-pull protocol critically rely on the fact that a node can be contacted by many nodes in a single round, e.g., [2]. However, in order to obtain applicable and scalable protocols, ideally, we would like to not only limit the number of interactions each node initiates, but also the number of interactions each node participates in. We therefore study a weaker variant of the described random pull algorithm, which we call rpull (stands for restricted pull). In each round, every node can still initiate a connection to one uniformly random neighbor.
Document type :
Conference papers
Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing
Liste complète des métadonnées

Cited literature [3 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01207841
Contributor : Matthieu Roy <>
Submitted on : Thursday, October 1, 2015 - 2:20:07 PM
Last modification on : Monday, October 5, 2015 - 10:45:41 AM
Document(s) archivé(s) le : Saturday, January 2, 2016 - 11:01:51 AM

File

14-BA.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01207841, version 1

Collections

Citation

Sebastian Daum, Fabian Kuhn, Yannic Maus. Brief Announcement: Rumor Spreading with Bounded In-Degree. Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing. 〈hal-01207841〉

Share

Metrics

Record views

83

Files downloads

73