Meeting the deadline: On the complexity of fault-tolerant Continuous Gossip

Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowalski

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ensure good "Quality of Delivery," i.e., to deliver every rumor to every process before the deadline expires. Thus, a trivial solution to the problem of Continuous Gossip is simply for every process to broadcast every rumor as soon as it is injected. Unfortunately, this solution has a high per-round message complexity. Complicating matters, we focus our attention on a highly dynamic network in which processes may continually crash and recover. In order to achieve good per-round message complexity in a dynamic network, processes need to continually form and re-form coalitions that cooperate to spread their rumors throughout the network. The key challenge for a Continuous Gossip protocol is the ongoing adaptation to the ever-changing set of active rumors and non-crashed process. In this work we show how to address this challenge; we develop randomized and deterministic protocols for Continuous Gossip and prove lower bounds on the per-round message-complexity, indicating that our protocols are close to optimal.

Original languageEnglish (US)
Title of host publicationPODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing
Pages247-256
Number of pages10
DOIs
StatePublished - Sep 8 2010
Externally publishedYes
Event29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010 - Zurich, Switzerland
Duration: Jul 25 2010Jul 28 2010

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010
CountrySwitzerland
CityZurich
Period7/25/107/28/10

Keywords

  • Crashes and restarts
  • Dynamic rumor injection
  • Expander graphs
  • Gossip

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Georgiou, C., Gilbert, S., & Kowalski, D. R. (2010). Meeting the deadline: On the complexity of fault-tolerant Continuous Gossip. In PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing (pp. 247-256). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). https://doi.org/10.1145/1835698.1835759

Meeting the deadline : On the complexity of fault-tolerant Continuous Gossip. / Georgiou, Chryssis; Gilbert, Seth; Kowalski, Dariusz R.

PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing. 2010. p. 247-256 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Georgiou, C, Gilbert, S & Kowalski, DR 2010, Meeting the deadline: On the complexity of fault-tolerant Continuous Gossip. in PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, pp. 247-256, 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, 7/25/10. https://doi.org/10.1145/1835698.1835759
Georgiou C, Gilbert S, Kowalski DR. Meeting the deadline: On the complexity of fault-tolerant Continuous Gossip. In PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing. 2010. p. 247-256. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). https://doi.org/10.1145/1835698.1835759
Georgiou, Chryssis ; Gilbert, Seth ; Kowalski, Dariusz R. / Meeting the deadline : On the complexity of fault-tolerant Continuous Gossip. PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing. 2010. pp. 247-256 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).
@inproceedings{df5807f56b4a4106a7ab3545f22ae57d,
title = "Meeting the deadline: On the complexity of fault-tolerant Continuous Gossip",
abstract = "In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ensure good {"}Quality of Delivery,{"} i.e., to deliver every rumor to every process before the deadline expires. Thus, a trivial solution to the problem of Continuous Gossip is simply for every process to broadcast every rumor as soon as it is injected. Unfortunately, this solution has a high per-round message complexity. Complicating matters, we focus our attention on a highly dynamic network in which processes may continually crash and recover. In order to achieve good per-round message complexity in a dynamic network, processes need to continually form and re-form coalitions that cooperate to spread their rumors throughout the network. The key challenge for a Continuous Gossip protocol is the ongoing adaptation to the ever-changing set of active rumors and non-crashed process. In this work we show how to address this challenge; we develop randomized and deterministic protocols for Continuous Gossip and prove lower bounds on the per-round message-complexity, indicating that our protocols are close to optimal.",
keywords = "Crashes and restarts, Dynamic rumor injection, Expander graphs, Gossip",
author = "Chryssis Georgiou and Seth Gilbert and Kowalski, {Dariusz R.}",
year = "2010",
month = "9",
day = "8",
doi = "10.1145/1835698.1835759",
language = "English (US)",
isbn = "9781605588889",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
pages = "247--256",
booktitle = "PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing",

}

TY - GEN

T1 - Meeting the deadline

T2 - On the complexity of fault-tolerant Continuous Gossip

AU - Georgiou, Chryssis

AU - Gilbert, Seth

AU - Kowalski, Dariusz R.

PY - 2010/9/8

Y1 - 2010/9/8

N2 - In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ensure good "Quality of Delivery," i.e., to deliver every rumor to every process before the deadline expires. Thus, a trivial solution to the problem of Continuous Gossip is simply for every process to broadcast every rumor as soon as it is injected. Unfortunately, this solution has a high per-round message complexity. Complicating matters, we focus our attention on a highly dynamic network in which processes may continually crash and recover. In order to achieve good per-round message complexity in a dynamic network, processes need to continually form and re-form coalitions that cooperate to spread their rumors throughout the network. The key challenge for a Continuous Gossip protocol is the ongoing adaptation to the ever-changing set of active rumors and non-crashed process. In this work we show how to address this challenge; we develop randomized and deterministic protocols for Continuous Gossip and prove lower bounds on the per-round message-complexity, indicating that our protocols are close to optimal.

AB - In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ensure good "Quality of Delivery," i.e., to deliver every rumor to every process before the deadline expires. Thus, a trivial solution to the problem of Continuous Gossip is simply for every process to broadcast every rumor as soon as it is injected. Unfortunately, this solution has a high per-round message complexity. Complicating matters, we focus our attention on a highly dynamic network in which processes may continually crash and recover. In order to achieve good per-round message complexity in a dynamic network, processes need to continually form and re-form coalitions that cooperate to spread their rumors throughout the network. The key challenge for a Continuous Gossip protocol is the ongoing adaptation to the ever-changing set of active rumors and non-crashed process. In this work we show how to address this challenge; we develop randomized and deterministic protocols for Continuous Gossip and prove lower bounds on the per-round message-complexity, indicating that our protocols are close to optimal.

KW - Crashes and restarts

KW - Dynamic rumor injection

KW - Expander graphs

KW - Gossip

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

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

U2 - 10.1145/1835698.1835759

DO - 10.1145/1835698.1835759

M3 - Conference contribution

AN - SCOPUS:77956256339

SN - 9781605588889

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

SP - 247

EP - 256

BT - PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing

ER -