The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Order Optimal Information Spreading Using Algebraic Gossip
[article]
2011
arXiv
pre-print
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. For arbitrary networks we provide a new upper bound for uniform algebraic gossip of O((k+ n + D)Δ) rounds with high probability, where D and Δ are the diameter and the maximum degree in the network, respectively. For many topologies and selections of k this bound improves previous results, in particular, for graphs with a
arXiv:1101.4372v1
fatcat:pdvivppj5bchjhaaan3hlktzp4