Meeting the deadline: On the complexity of fault-tolerant continuous gossip

Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowalski

Research output: Contribution to journalArticle

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 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 perround 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 noncrashed process. In this work we show how to address this challenge; we develop randomized and deterministic proto- cols for Continuous Gossip and prove lower bounds on the per-round message-complexity, indicating that our protocols are close to optimal.

Original languageEnglish (US)
Pages (from-to)223-244
Number of pages22
JournalDistributed Computing
Volume24
Issue number5
DOIs
StatePublished - Dec 1 2011
Externally publishedYes

Fingerprint

Gossip
Deadline
Fault-tolerant
Message Complexity
Dynamic Networks
Crash
Coalitions
Broadcast
Trivial
Lower bound

Keywords

  • Crashes and restarts
  • Dynamic rumor injection
  • Gossip
  • Random and expander graphs

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computational Theory and Mathematics

Cite this

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

In: Distributed Computing, Vol. 24, No. 5, 01.12.2011, p. 223-244.

Research output: Contribution to journalArticle

Georgiou, Chryssis ; Gilbert, Seth ; Kowalski, Dariusz R. / Meeting the deadline : On the complexity of fault-tolerant continuous gossip. In: Distributed Computing. 2011 ; Vol. 24, No. 5. pp. 223-244.
@article{a7cac5a06f29475ca4574732e14f44d7,
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 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 perround 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 noncrashed process. In this work we show how to address this challenge; we develop randomized and deterministic proto- cols 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, Gossip, Random and expander graphs",
author = "Chryssis Georgiou and Seth Gilbert and Kowalski, {Dariusz R.}",
year = "2011",
month = "12",
day = "1",
doi = "10.1007/s00446-011-0144-6",
language = "English (US)",
volume = "24",
pages = "223--244",
journal = "Distributed Computing",
issn = "0178-2770",
publisher = "Springer Verlag",
number = "5",

}

TY - JOUR

T1 - Meeting the deadline

T2 - On the complexity of fault-tolerant continuous gossip

AU - Georgiou, Chryssis

AU - Gilbert, Seth

AU - Kowalski, Dariusz R.

PY - 2011/12/1

Y1 - 2011/12/1

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 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 perround 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 noncrashed process. In this work we show how to address this challenge; we develop randomized and deterministic proto- cols 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 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 perround 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 noncrashed process. In this work we show how to address this challenge; we develop randomized and deterministic proto- cols 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 - Gossip

KW - Random and expander graphs

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

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

U2 - 10.1007/s00446-011-0144-6

DO - 10.1007/s00446-011-0144-6

M3 - Article

AN - SCOPUS:84855594589

VL - 24

SP - 223

EP - 244

JO - Distributed Computing

JF - Distributed Computing

SN - 0178-2770

IS - 5

ER -