Back to Search
Start Over
FAST INFORMATION SPREADING IN GRAPHS WITH LARGE WEAK CONDUCTANCE.
- Source :
-
SIAM Journal on Computing . 2012, Vol. 41 Issue 6, p1451-1465. 15p. - Publication Year :
- 2012
-
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 time bounds 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 weak conductance, a generalization of classic graph conductance which measures how well-connected the components of a graph are. Our hybrid algorithm, which alternates between random and deterministic communication phases, exploits the connectivity within components by first applying partial information spreading, in which information is exchanged within well-connected components, and then sending messages across bottlenecks, thus spreading further throughout the network. This yields substantial improvements over the best known running times of algorithms for information spreading on any graph that has large weak conductance, from a polynomial to a polylogarithmic number of rounds. [ABSTRACT FROM AUTHOR]
- Subjects :
- *DISTRIBUTED computing
*ALGORITHMS
*GRAPH theory
*COMMUNICATION
*PROBABILITY theory
Subjects
Details
- Language :
- English
- ISSN :
- 00975397
- Volume :
- 41
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- SIAM Journal on Computing
- Publication Type :
- Academic Journal
- Accession number :
- 89522330
- Full Text :
- https://doi.org/10.1137/110845380