Name
Abstract | ||
|---|---|---|
A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph. We consider distributed gossip protocols wherein the agents themselves instead of a global scheduler determine whom to call. In this paper the problem of designing and analyzing gossip protocols is given a dynamic twist by assuming that when a call is established not only secrets are exchanged but also telephone numbers. Both numbers and secrets can be represented by edges in a gossip graph. Thus, each call may change both the number relation and the secret relation of the graph. We define various such distributed dynamic gossip protocols, and we characterize them in terms of the class of graphs where they terminate successfully. |
Year | Venue | DocType |
|---|---|---|
2015 | Bulletin of the Iranian Mathematical Society | Journal |
Volume | Citations | PageRank |
abs/1511.00867 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hans P. van Ditmarsch | 1 | 656 | 79.59 |
| Jan van Eijck | 2 | 312 | 47.08 |
| Pere Pardo | 3 | 47 | 8.63 |
| Rahim Ramezanian | 4 | 0 | 0.34 |
| François Schwarzentruber | 5 | 170 | 29.05 |