A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Broadcast and gossip in line-communication mode
1997
Discrete Applied Mathematics
This paper addresses the problem of efficiently performing two important operations of communication in networks, namely broadcast and gossip. We study these operations in the line-communication m&eel that is similar to the circuit-switching technique. We propose a simpler proof of the fundamental result, due to A. Farley, that gives the exact broadcast time, [log, nl steps, in any connected network of order n. In the second part we construct gossip algorithms in any tree network and we prove
doi:10.1016/s0166-218x(97)00054-1
fatcat:ri6jyao62jfxnk3xmahgenzrze