Loading...
conference paper
Algebraic gossip on Arbitrary Networks
2009
ISIT'09: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory
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.
Type
conference paper
Authors
Publication date
2009
Publisher
Published in
ISIT'09: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory
ISBN of the book
978-1-424443-12-3
Volume
1
Subjects
URL
Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
Event name | Event place | Event date |
Seoul, Korea | July, 2009 | |
Available on Infoscience
January 10, 2009
Use this identifier to reference this record