A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
[chapter]
STACS 2007
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized broadcasting protocol: At some time t an information r is placed at one of the nodes of a graph G. In the succeeding steps, each informed node chooses one neighbor, independently and uniformly at random, and informs this neighbor by sending a copy of r to it. First, we consider the relationship between randomized
doi:10.1007/978-3-540-70918-3_15
dblp:conf/stacs/ElsasserS07
fatcat:mfvaiztmc5crllaaakn4ncnmle