Information Spreading in Dynamic Networks under Oblivious Adversaries

John Augustine
John Augustine
Mehraneh Liaee
Mehraneh Liaee

DISC, 2016.

Cited by: 7|Bibtex|Views9
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

We study the problem of gossip in dynamic networks controlled by an adversary that can modify the network arbitrarily from one round to another, provided that the network is always connected. In the gossip problem, there are n tokens arbitrarily distributed among the n network nodes, and the goal is to disseminate all the n tokens to ever...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments