Randomized broadcast in networks

Uriel Feige; David Peleg; Prabhakar Raghavan; Eli Upfal

doi:10.1002/rsa.3240010406

Randomized broadcast in networks

Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal

Research output: Contribution to journal › Article › peer-review

161 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: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases.

Original language	English
Pages (from-to)	447-460
Number of pages	14
Journal	Random Structures and Algorithms
Volume	1
Issue number	4
DOIs	https://doi.org/10.1002/rsa.3240010406
State	Published - 1990
Externally published	Yes

Keywords

distributed computation
random graphs
randomized algorithms
rumor propagation

Access to Document

10.1002/rsa.3240010406

Cite this

@article{3026f5541f1a4bd2a7dbea6d8613be68,

title = "Randomized broadcast in networks",

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: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases.",

keywords = "distributed computation, random graphs, randomized algorithms, rumor propagation",

author = "Uriel Feige and David Peleg and Prabhakar Raghavan and Eli Upfal",

year = "1990",

doi = "10.1002/rsa.3240010406",

language = "אנגלית",

volume = "1",

pages = "447--460",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "4",

}

TY - JOUR

T1 - Randomized broadcast in networks

AU - Feige, Uriel

AU - Peleg, David

AU - Raghavan, Prabhakar

AU - Upfal, Eli

PY - 1990

Y1 - 1990

N2 - 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: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases.

AB - 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: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases.

KW - distributed computation

KW - random graphs

KW - randomized algorithms

KW - rumor propagation

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

U2 - 10.1002/rsa.3240010406

DO - 10.1002/rsa.3240010406

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84990713448

SN - 1042-9832

VL - 1

SP - 447

EP - 460

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 4

ER -

Randomized broadcast in networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this