Name
Abstract | ||
|---|---|---|
We study the problem of gossip in dynamic networks controlled by an adversary that can modify the network arbitrarily from one round to another, provided that the network is always connected. In the gossip problem, there are n tokens arbitrarily distributed among the n network nodes, and the goal is to disseminate all the n tokens to every node. Our focus is on token-forwarding algorithms, which do not manipulate tokens in any way other than storing, copying, and forwarding them. An important open question is whether gossip can be realized by a distributed protocol that can do significantly better than an easily achievable bound of (O(n^2)) rounds. |
Year | Venue | DocType |
|---|---|---|
2016 | DISC | Conference |
Volume | Citations | PageRank |
abs/1607.05645 | 3 | 0.39 |
References | Authors | |
24 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Augustine | 1 | 4 | 1.08 |
| Chen Avin | 2 | 608 | 48.60 |
| Mehraneh Liaee | 3 | 3 | 0.39 |
| Gopal Pandurangan | 4 | 921 | 78.62 |
| Rajmohan Rajaraman | 5 | 2038 | 250.08 |