The effects of link failures on computations in asynchronous rings
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Electing a leader in a ring with link failures
Acta Informatica
Detecting global termination conditions in the face of uncertainty
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Optimal fault-tolerant distributed construction of a spanning forest
Information Processing Letters
Fault tolerant distributed majority commitment
Journal of Algorithms
Local management of a global resource in a communication network
Journal of the ACM (JACM)
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A distributed algorithm for generalized deadlock detection
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Controller and estimator for dynamic networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Labeling schemes for weighted dynamic trees
Information and Computation
Dynamic routing schemes for graphs with low local density
ACM Transactions on Algorithms (TALG)
New bounds for the controller problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Tracking distributed aggregates over time-based sliding windows
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Hi-index | 0.01 |
Consider a distributed network in which events occur at arbitrary nodes and at unpredicted times. An event occurring at node u is sensed only by u which in turn may invoke a communication protocol that allows nodes to exchange messages with their neighbors. We are interested in the following threshold detection (TD) problem inherent to distributed computing: Given some threshold k, the goal of a TD protocol is to broadcast a termination signal when at least k events have occurred (throughout the network). In this paper we develop a randomized TD protocol that may fail with negligible probability but which significantly improves previous results in terms of the message complexity, namely, the total number of messages sent by all participating nodes. With the right choice of parameters our randomized protocol turns into a deterministic one that guarantees low communication burden for any node. This is a principal complexity measure in many applications of wireless networks and which, to the best of our knowledge, has not been bounded before in the context of such problems.