### Abstract

In this paper, we study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. In short, we show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. This latter fact implies that there exist message-efficient asynchronous (randomized) consensus protocols, in the context of an oblivious adversary. In more detail, we summarize our results as follows. If the adversary is adaptive, we show that a randomized asynchronous gossip algorithm cannot terminate in fewer than O(f{d + δ)) time steps unless Ω(n + f^{2}) messages are exchanged, where n is the total number of processes, f is the number of tolerated crash failures, d is the maximum communication delay for the specific execution in question, and δ is the bound on relative process speeds in the specific execution. The lower bound result is to be contrasted with deterministic synchronous gossip algorithms that, even against an adaptive adversary, require only O(polylog(n)) time steps and O(n polylog(n)) messages. In the case of an oblivious adversary, we present three different randomized, asynchronous algorithms that provide different trade-offs between time complexity and message complexity. The first algorithm is based on the epidemic paradigm, and completes in O(n/n-f log^{2} n(d + δ)) time steps using O(n log^{3} n(d+δ)) messages, with high probability. The second algorithm relies on more rapid dissemination of the rumors, yielding a constant-time (w.r.t. n) gossip protocol: for every constant ε < 1, and for f ≤ n/2, there is a variant with time complexity O(1/ε(d +δ)) and message complexity

Original language | English (US) |
---|---|

Title of host publication | PODC'08 |

Subtitle of host publication | Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing |

Pages | 135-144 |

Number of pages | 10 |

State | Published - Dec 17 2008 |

Externally published | Yes |

Event | 27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing - Toronto, ON, Canada Duration: Aug 18 2008 → Aug 21 2008 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Principles of Distributed Computing |
---|

### Conference

Conference | 27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing |
---|---|

Country | Canada |

City | Toronto, ON |

Period | 8/18/08 → 8/21/08 |

### Fingerprint

### Keywords

- Adaptive versus oblivious adversary
- Asynchrony
- Complexity
- Consensus
- Epidemic
- Gossip
- Randomization

### ASJC Scopus subject areas

- Software
- Hardware and Architecture
- Computer Networks and Communications

### Cite this

*PODC'08: Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing*(pp. 135-144). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

**On the complexity of asynchronous gossip.** / Georgiou, Chryssis; Gilbert, Seth; Guerraoui, Rachid; Kowalski, Dariusz R.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*PODC'08: Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing.*Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, pp. 135-144, 27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Toronto, ON, Canada, 8/18/08.

}

TY - GEN

T1 - On the complexity of asynchronous gossip

AU - Georgiou, Chryssis

AU - Gilbert, Seth

AU - Guerraoui, Rachid

AU - Kowalski, Dariusz R.

PY - 2008/12/17

Y1 - 2008/12/17

N2 - In this paper, we study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. In short, we show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. This latter fact implies that there exist message-efficient asynchronous (randomized) consensus protocols, in the context of an oblivious adversary. In more detail, we summarize our results as follows. If the adversary is adaptive, we show that a randomized asynchronous gossip algorithm cannot terminate in fewer than O(f{d + δ)) time steps unless Ω(n + f2) messages are exchanged, where n is the total number of processes, f is the number of tolerated crash failures, d is the maximum communication delay for the specific execution in question, and δ is the bound on relative process speeds in the specific execution. The lower bound result is to be contrasted with deterministic synchronous gossip algorithms that, even against an adaptive adversary, require only O(polylog(n)) time steps and O(n polylog(n)) messages. In the case of an oblivious adversary, we present three different randomized, asynchronous algorithms that provide different trade-offs between time complexity and message complexity. The first algorithm is based on the epidemic paradigm, and completes in O(n/n-f log2 n(d + δ)) time steps using O(n log3 n(d+δ)) messages, with high probability. The second algorithm relies on more rapid dissemination of the rumors, yielding a constant-time (w.r.t. n) gossip protocol: for every constant ε < 1, and for f ≤ n/2, there is a variant with time complexity O(1/ε(d +δ)) and message complexity

AB - In this paper, we study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. In short, we show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. This latter fact implies that there exist message-efficient asynchronous (randomized) consensus protocols, in the context of an oblivious adversary. In more detail, we summarize our results as follows. If the adversary is adaptive, we show that a randomized asynchronous gossip algorithm cannot terminate in fewer than O(f{d + δ)) time steps unless Ω(n + f2) messages are exchanged, where n is the total number of processes, f is the number of tolerated crash failures, d is the maximum communication delay for the specific execution in question, and δ is the bound on relative process speeds in the specific execution. The lower bound result is to be contrasted with deterministic synchronous gossip algorithms that, even against an adaptive adversary, require only O(polylog(n)) time steps and O(n polylog(n)) messages. In the case of an oblivious adversary, we present three different randomized, asynchronous algorithms that provide different trade-offs between time complexity and message complexity. The first algorithm is based on the epidemic paradigm, and completes in O(n/n-f log2 n(d + δ)) time steps using O(n log3 n(d+δ)) messages, with high probability. The second algorithm relies on more rapid dissemination of the rumors, yielding a constant-time (w.r.t. n) gossip protocol: for every constant ε < 1, and for f ≤ n/2, there is a variant with time complexity O(1/ε(d +δ)) and message complexity

KW - Adaptive versus oblivious adversary

KW - Asynchrony

KW - Complexity

KW - Consensus

KW - Epidemic

KW - Gossip

KW - Randomization

UR - http://www.scopus.com/inward/record.url?scp=57549085187&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57549085187&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:57549085187

SN - 9781595939890

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 135

EP - 144

BT - PODC'08

ER -