A stochastic characterization of a fault-tolerant gossip algorithm

Xiaohu Li, Paul Parker, Shouhuai Xu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Gossiping is a popular technique for probabilistic reliable multicast (or broadcast), whose service is often needed in reliable distributed computing and systems. However, existing analytic studies of gossip schemes are often based on ideas borrowed from epidemic models, and thus inherit some features that may not be appropriate for the setting of gossiping. Specifically, in epidemic spreading, an infected node typically intends to spread the infection an unbounded number of times (or rounds); whereas in gossiping, an infected node (i.e., a node having received the message in question) may prefer to gossip the message a bounded number of times. Motivated by this, we intend to understand the behavior of a simple abstraction and algorithm for a popular class of fault-tolerant gossip schemes.

Original languageEnglish
Title of host publicationProceedings - 10th IEEE International Symposium on High Assurance Systems Engineering, HASE 2007
Pages283-290
Number of pages8
DOIs
StatePublished - 2007
Event10th IEEE International Symposium on High Assurance Systems Engineering, HASE 2007 - Dallas, TX, United States
Duration: 14 Nov 200716 Nov 2007

Publication series

NameProceedings of IEEE International Symposium on High Assurance Systems Engineering
ISSN (Print)1530-2059

Conference

Conference10th IEEE International Symposium on High Assurance Systems Engineering, HASE 2007
Country/TerritoryUnited States
CityDallas, TX
Period14/11/0716/11/07

Fingerprint

Dive into the research topics of 'A stochastic characterization of a fault-tolerant gossip algorithm'. Together they form a unique fingerprint.

Cite this