DMCA
Fast Information Spreading in Graphs with Large Weak Conductance
Cached
Download Links
| Citations: | 17 - 2 self |
BibTeX
@MISC{Censor-hillel_fastinformation,
author = {Keren Censor-hillel and Hadas Shachnai},
title = {Fast Information Spreading in Graphs with Large Weak Conductance},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Gathering data from nodes in a network is at the heart of many distributed applications, most notably, while performing a global task. We consider information spreading among n nodes of a network, where each node v has a message m(v) which must be received by all other nodes. The time required for information spreading has been previously upper-bounded with an inverse relationship to the conductance of the underlying communication graph. This implies high running times for graphs with small conductance. The main contribution of this paper is an information spreading algorithm which overcomes communication bottlenecks and thus achieves fast information spreading for a wide class of graphs, despite their small conductance. As a key tool in our study we use the recently defined concept of
