Electing a leader in a synchronous ring
Journal of the ACM (JACM)
The effects of link failures on computations in asynchronous rings
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
End-to-end communication in unreliable networks
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
The power of multimedia: combining point-to-point and multiaccess networks
Information and Computation
Bootstrap network resynchronization (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Message Terminate Algorithms for Anonymous Rings of Unknown Size
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On the complexity of computation in the presence of link failures: the case of a ring
Distributed Computing
Local heuristics and the emergence of spanning subgraphs in complex networks
Theoretical Computer Science - Complex networks
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
| Hi-index | 0.00 |
This paper presents Ω(m log n) and Ω(mn) messages lower bounds on the problem of computing a global sensitive function in bidirectional networks with link failures (i.e., dynamically changing topology), where n and m are the total number of nodes and links in the network. The Ω(mlogn) lower bound is under the assumption that n is a-priori known to the nodes, while the second bound is for the case in which such knowledge is not available. A global sensitive function of n variables is a function that may not be computed without the knowledge of the values of all the n variables (e.g. maximum, sum, etc). Thus, computing such a function at one node of a distributed network requires this node to communicate with every other node in the network. Though lower bounds higher than Ω(m) messages are known for this problem in the context of link failures, none holds for dense bidirectional networks. Moreover, we are not aware of any other non-trivial lower bound higher than Ω(m) for dense bidirectional networks.