On the push&pull protocol for rumour spreading

  title={On the push&pull protocol for rumour spreading},
  author={H{\"u}seyin Acan and Andrea Collevecchio and Abbas Mehrabian and Nicholas C. Wormald},
The asynchronous push&pull protocol, a randomized distributed algorithm for spreading a rumour in a graph G, is defined as follows. Independent exponential clocks of rate 1 are associated with the vertices of G, one to each vertex. Initially, one vertex of G knows the rumour. Whenever the clock of a vertex x rings, it calls a random neighbour y: if x knows the rumour and y does not, then x tells y the rumour (a push operation), and if x does not know the rumour and y knows it, y tells x the… CONTINUE READING