Concurrent Broadcast for Information Dissemination
IEEE Transactions on Software Engineering
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On the expected complexity of distributed selection
Journal of Parallel and Distributed Computing
A distributed selection algorithm and its expected communication complexity
Theoretical Computer Science
The probabilistic communication complexity of set intersection
SIAM Journal on Discrete Mathematics
On the distributional complexity of disjointness
Theoretical Computer Science
Efficient Distributed Selection with Bounded Messages
IEEE Transactions on Parallel and Distributed Systems
Communication complexity
Distributed k-selection: From a sequential to a distributed algorithm
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
The impact of synchronous communication on the problem of electing a leader in a ring
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Tight Lower Bounds for the Distinct Elements Problem
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
A note on efficient aggregate queries in sensor networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Tight bounds for distributed selection
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Distributed computation of the mode
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
An optimal lower bound on the communication complexity of gap-hamming-distance
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fast Distributed Algorithms for Computing Separable Functions
IEEE Transactions on Information Theory
The communication complexity of distributed task allocation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Bounded-contention coding for wireless networks in the high SNR regime
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
We study problems of data aggregation, such as approximate counting and computing the minimum input value, in synchronous directed networks with bounded message bandwidth B = Ω(log n). In undirected networks of diameter D, many such problems can easily be solved in O(D) rounds, using O(log n)- size messages. We show that for directed networks this is not the case: when the bandwidth B is small, several classical data aggregation problems have a time complexity that depends polynomially on the size of the network, even when the diameter of the network is constant. We show that computing an ε-approximation to the size n of the network requires Ω(min{n, 1/ε2}/B) rounds, even in networks of diameter 2. We also show that computing a sensitive function (e.g., minimum and maximum) requires Ω(√n/B) rounds in networks of diameter 2, provided that the diameter is not known in advance to be o(√n/B). Our lower bounds are established by reduction from several well-known problems in communication complexity. On the positive side, we give a nearly optimal Õ(D+√n/B)-round algorithm for computing simple sensitive functions using messages of size B = Ω(logN), where N is a loose upper bound on the size of the network and D is the diameter.