Algebraic gossip on Arbitrary Networks

Details Algebraic gossip on Arbitrary Networks Algebraic gossip on Arbitrary Networks

2009-01-11

arxiv.org/abs/0901.1444v2

Computer Science

Information Theory

Paper has been withdrawn due to an error in the main proof

Scientific paper

Consider a network of nodes where each node has a message to communicate to all other nodes. For this communication problem, we analyze a gossip based protocol where coded messages are exchanged. This problem was studied by Aoyama and Shah where a bound to the dissemination time based on the spectral properties of the underlying communication graph is provided. Our contribution is a uniform bound that holds for arbitrary networks.

Affiliated with

Also associated with

No associations

Rating

Algebraic gossip on Arbitrary Networks 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 Algebraic gossip on Arbitrary Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic gossip on Arbitrary Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-258698