Algebraic gossip: A network coding approach to optimal multiple rumor mongering

Algebraic gossip: A network coding approach to optimal multiple rumor mongering (2004)

Cached

Download Links

[web.mit.edu]
[web.mit.edu]
[web.mit.edu]
[www.mit.edu]

Other Repositories/Bibliography

DBLP

by Supratim Deb , Muriel Médard

Venue:	IEEE Transactions on Information Theory
Citations:	54 - 7 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Algebraic gossip: A network coding approach to optimal multiple rumor mongering	INFERENCE
AUTHOR NAME	Supratim Deb	SVM HeaderParse 0.2
AUTHOR AFFIL	Laboratory for Information & Decision Systems; Massachusetts Institute of Technology	SVM HeaderParse 0.2
AUTHOR ADDR	Cambridge, MA-02139	SVM HeaderParse 0.2
AUTHOR NAME	Muriel Médard	SVM HeaderParse 0.2
AUTHOR AFFIL	Laboratory for Information & Decision Systems; Massachusetts Institute of Technology	SVM HeaderParse 0.2
AUTHOR ADDR	Cambridge, MA-02139	SVM HeaderParse 0.2
ABSTRACT	We study the problem of simultaneously disseminating multiple messages in a large network in a decentralized and distributed manner. We consider a network with n nodes and k (k = O(n)) messages spread throughout the network to start with, but not all nodes have all the messages. Our communication model is such that the nodes communicate in discrete-time steps, and in every time-step, each node communicates with a random communication partner chosen uniformly from all the nodes (known as the random phone call model). The system is bandwidth limited and in each time-step, only one message can be transmitted. The goal is to disseminate rapidly all the messages among all the nodes. We study the time required for this dissemination to occur with high probability, and also in expectation. We present a protocol based on random linear coding (RLC) that disseminates all the messages among all the nodes in O(n) time, which is order optimal, if we ignore the small overhead associated with each transmission. The overhead does not depend on the size of the messages and is less than 1 % for k = 100 and messages of size 100 KB. We also consider a store and forward mechanism without coding, which is a natural extension of gossip-based dissemination with one message in the network. We show that, such an uncoded scheme can do no better than a sequential approach (instead of doing it simultaneously) of disseminating the messages which takes Θ(n ln(n)) time, since disseminating a single message in a gossip network takes Θ(ln(n)) time. 1	SVM HeaderParse 0.2
YEAR	2004	INFERENCE
VENUE	IEEE Transactions on Information Theory	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	2486--2507	INFERENCE
VOLUME	52	INFERENCE
CITATIONS	14 found	ParsCit 1.0