On the Number of Rounds Necessary to Disseminate Information

@inproceedings{Even1989OnTN,
  title={On the Number of Rounds Necessary to Disseminate Information},
  author={Shimon Even and Burkhard Monien},
  booktitle={SPAA},
  year={1989}
}
Assume each processor in a network has some piece of information. We study how efficiently information can be spread in a communication network. Specifically, we investigate the number of rounds necessary to spread all the pieces of information to all processors. This problem is known as the "gossip" problem, and initially, the question was to determine the number of telephone calls necessary to achieve complete dissemination. In this paper we study the "telegraph comnmnication node", where in… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 40 CITATIONS

Fast Information Sharing in a Complete Network

  • Discrete Applied Mathematics
  • 1993
VIEW 4 EXCERPTS
CITES RESULTS & METHODS
HIGHLY INFLUENCED

Recognizing Kn! odel graphs

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Neighbourhood Gossiping in Hypercubes

  • Parallel Processing Letters
  • 1998
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Optimal odd gossiping

  • Discrete Applied Mathematics
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND

Odd gossiping

  • Discrete Applied Mathematics
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

Gossiping in circulant graphs

  • 2014
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.

Gossips and telegraphs

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL