Tight Bounds for Algebraic Gossip on Graphs

Details Tight Bounds for Algebraic Gossip on Graphs Tight Bounds for Algebraic Gossip on Graphs

2010-01-19

arxiv.org/abs/1001.3265v3

Computer Science

Information Theory

21 pages

Scientific paper

We study the stopping times of gossip algorithms for network coding. We analyze algebraic gossip (i.e., random linear coding) and consider three gossip algorithms for information spreading Pull, Push, and Exchange. The stopping time of algebraic gossip is known to be linear for the complete graph, but the question of determining a tight upper bound or lower bounds for general graphs is still open. We take a major step in solving this question, and prove that algebraic gossip on any graph of size n is O(D*n) where D is the maximum degree of the graph. This leads to a tight bound of Theta(n) for bounded degree graphs and an upper bound of O(n^2) for general graphs. We show that the latter bound is tight by providing an example of a graph with a stopping time of Omega(n^2). Our proofs use a novel method that relies on Jackson's queuing theorem to analyze the stopping time of network coding; this technique is likely to become useful for future research.

Affiliated with

Also associated with

No associations

Rating

Tight Bounds for Algebraic Gossip on Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tight Bounds for Algebraic Gossip on Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tight Bounds for Algebraic Gossip on Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-636140