Broadcast and Gossip in Line-communication Mode

  title={Broadcast and Gossip in Line-communication Mode},
  author={Christian Laforest},
  journal={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… CONTINUE READING