Randomized broadcast in networks

Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal

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

9 Scopus citations

Abstract

In this paper we study the rate at which a rumor spreads through an undirected graph. This study has two important applications in distributed computation; (1) in simple, robust and efficient broadcast protocols; (2) in the maintenance of replicated databases.

Original languageEnglish
Title of host publicationAlgorithms - International Symposium SlGAL 1990, Proceedings
EditorsToshihide lbaraki, Takao Nishizeki, Hiroshi Imai, Tetsuo Asano
PublisherSpringer Verlag
Pages128-137
Number of pages10
ISBN (Print)9783540529217
DOIs
StatePublished - 1990
Externally publishedYes
Event1st SIGAL International Symposium on Algorithms, 1990 - Tokyo, Japan
Duration: 16 Aug 199018 Aug 1990

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume450 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st SIGAL International Symposium on Algorithms, 1990
Country/TerritoryJapan
CityTokyo
Period16/08/9018/08/90

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1990.

Fingerprint

Dive into the research topics of 'Randomized broadcast in networks'. Together they form a unique fingerprint.

Cite this