Algebraic gossip on Arbitrary Networks

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 Shah et al 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.


Presented at:
IEEE International Symposium on Information Theory (ISIT), Seoul, July 2009
Keywords:
Laboratories:




 Record created 2009-01-10, last modified 2018-09-13

External link:
Download fulltext
URL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)