Fast gossiping with short unreliable messages

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc

Research output: Contribution to journalArticle

Abstract

Each of n nodes of a communication network has a piece of information (gossip) which should be made known to all other nodes. Gossiping is done by sending letters. In a unit of time each node can either send one letter to a neighbor or receive one such letter, containing one gossip currently known to the sender. Letters reach their destinations with constant probability 0<q<1, independently of one another. For a large class of networks, including rings, grids, hypercubes and complete graphs, we construct gossip schemes working in linear time and successfully performing gossiping with probability converging to 1, as the number of nodes grows.

Original languageEnglish (US)
Pages (from-to)15-24
Number of pages10
JournalDiscrete Applied Mathematics
Volume53
Issue number1-3
DOIs
StatePublished - Sep 14 1994
Externally publishedYes

Fingerprint

Gossiping
Gossip
Vertex of a graph
Telecommunication networks
Ring Network
Unit of time
Hypercube
Communication Networks
Complete Graph
Linear Time
Grid

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

Fast gossiping with short unreliable messages. / Chlebus, Bogdan S.; Diks, Krzysztof; Pelc, Andrzej.

In: Discrete Applied Mathematics, Vol. 53, No. 1-3, 14.09.1994, p. 15-24.

Research output: Contribution to journalArticle

Chlebus, Bogdan S. ; Diks, Krzysztof ; Pelc, Andrzej. / Fast gossiping with short unreliable messages. In: Discrete Applied Mathematics. 1994 ; Vol. 53, No. 1-3. pp. 15-24.
@article{8f866aaad9494c4196da72517b3347bb,
title = "Fast gossiping with short unreliable messages",
abstract = "Each of n nodes of a communication network has a piece of information (gossip) which should be made known to all other nodes. Gossiping is done by sending letters. In a unit of time each node can either send one letter to a neighbor or receive one such letter, containing one gossip currently known to the sender. Letters reach their destinations with constant probability 0",
author = "Chlebus, {Bogdan S.} and Krzysztof Diks and Andrzej Pelc",
year = "1994",
month = "9",
day = "14",
doi = "10.1016/0166-218X(94)90176-7",
language = "English (US)",
volume = "53",
pages = "15--24",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Fast gossiping with short unreliable messages

AU - Chlebus, Bogdan S.

AU - Diks, Krzysztof

AU - Pelc, Andrzej

PY - 1994/9/14

Y1 - 1994/9/14

N2 - Each of n nodes of a communication network has a piece of information (gossip) which should be made known to all other nodes. Gossiping is done by sending letters. In a unit of time each node can either send one letter to a neighbor or receive one such letter, containing one gossip currently known to the sender. Letters reach their destinations with constant probability 0

AB - Each of n nodes of a communication network has a piece of information (gossip) which should be made known to all other nodes. Gossiping is done by sending letters. In a unit of time each node can either send one letter to a neighbor or receive one such letter, containing one gossip currently known to the sender. Letters reach their destinations with constant probability 0

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

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

U2 - 10.1016/0166-218X(94)90176-7

DO - 10.1016/0166-218X(94)90176-7

M3 - Article

AN - SCOPUS:0012488723

VL - 53

SP - 15

EP - 24

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 1-3

ER -