Optimal Sequential Gossiping by Short Messages

International audienceGossiping is the process of information di ffusion 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 communicating nodes can exchange up to a fixed number p of blocks during each call. We study the minimum numbers of call necessary to perform gossiping among n processor for any arbitrary fixed upper bound on the message size p