Optimal sequential gossiping by short messages

AbstractGossiping is the process of information diffusion in which each node of a network holds a block that must be communicated to all the other nodes in the network. We consider the problem of gossiping in communication networks under the restriction that during a call each of the communicating nodes can send up to p blocks. We study the minimum number of calls necessary to perform gossiping among n processors for any arbitrary fixed upper bound on the message size p