TY - JOUR

T1 - Order optimal information spreading using algebraic gossip

AU - Avin, Chen

AU - Borokhovich, Michael

AU - Censor-Hillel, Keren

AU - Lotker, Zvi

N1 - Funding Information:
Keren Censor-Hillel was partially supported by NSF Award 0939370-CCF. Zvi Lotker and Michael Borokhovich were supported in part by a grant from the Israel Science Foundation (894/09). We would like to thank the anonymous reviewers who helped us to significantly improve the paper.
Funding Information:
Keren Censor-Hillel was partially supported by NSF Award 0939370-CCF.

PY - 2013/4/1

Y1 - 2013/4/1

N2 - 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+log 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 constant maximum degree it implies that uniform gossip is order optimal and the stopping time is θ (k + D). To eliminate the factor of δ from the upper bound we propose a non-uniform gossip protocol, TAG, which is based on algebraic gossip and an arbitrary spanning tree protocol S. The stopping time of TAG is O(k+log n +d(S))+t(S), where t(S) is the stopping time of the spanning tree protocol, and d(S) is the diameter of the spanning tree. We provide two general cases in which this bound leads to an order optimal protocol. The first is for k=ω (n), where, using a simple gossip broadcast protocol that creates a spanning tree in at most linear time, we show that TAG finishes after θ (n) rounds for any graph. The second uses a sophisticated, recent gossip protocol to build a fast spanning tree on graphs with large weak conductance. In turn, this leads to the optimally of TAG on these graphs for k=ω (text{ polylog }(n)). The technique used in our proofs relies on queuing theory, which is an interesting approach that can be useful in future gossip analysis.

AB - 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+log 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 constant maximum degree it implies that uniform gossip is order optimal and the stopping time is θ (k + D). To eliminate the factor of δ from the upper bound we propose a non-uniform gossip protocol, TAG, which is based on algebraic gossip and an arbitrary spanning tree protocol S. The stopping time of TAG is O(k+log n +d(S))+t(S), where t(S) is the stopping time of the spanning tree protocol, and d(S) is the diameter of the spanning tree. We provide two general cases in which this bound leads to an order optimal protocol. The first is for k=ω (n), where, using a simple gossip broadcast protocol that creates a spanning tree in at most linear time, we show that TAG finishes after θ (n) rounds for any graph. The second uses a sophisticated, recent gossip protocol to build a fast spanning tree on graphs with large weak conductance. In turn, this leads to the optimally of TAG on these graphs for k=ω (text{ polylog }(n)). The technique used in our proofs relies on queuing theory, which is an interesting approach that can be useful in future gossip analysis.

KW - Algebraic Gossip

KW - Conductance

KW - Gossip algorithms

KW - Information spreading

KW - Network capacity

KW - Network coding

UR - http://www.scopus.com/inward/record.url?scp=84877830956&partnerID=8YFLogxK

U2 - 10.1007/s00446-013-0187-y

DO - 10.1007/s00446-013-0187-y

M3 - Article

AN - SCOPUS:84877830956

VL - 26

SP - 99

EP - 117

JO - Distributed Computing

JF - Distributed Computing

SN - 0178-2770

IS - 2

ER -