Order Optimal Information Spreading Using Algebraic Gossip

Chen Avin, Michael Borokhovich, Keren Censor-Hillel +1

In this paper we study gossip based information spreading with bounded message sizes. We use algebraic gossip to disseminate $k$ distinct messages to all $n$ nodes in a network. Fo…