Broadcasting in a hypercube when some calls fail
Information Processing Letters
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Reliable broadcasting in logarithmic time with Byzantine link failures
Journal of Algorithms
Minimum time broadcast in faulty star networks
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Broadcasting in hypercubes and star graphs with dynamic faults
Information Processing Letters
Optimal broadcasting in hypercubes with dynamic faults
Information Processing Letters
Distributed Function Evaluation in the Presence of Transmission Faults
SIGAL '90 Proceedings of the International Symposium on Algorithms
Dynamic faults have small effect on broadcasting in hypercubes
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Feasibility and complexity of broadcasting with random transmission failures
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Agreement in synchronous networks with ubiquitous faults
Theoretical Computer Science
| Hi-index | 5.23 |
Unlike localized communication failures that occur on a fixed (although a priori unknown) set of links, dynamic faults can occur on any link. Known also as mobile or ubiquitous faults, their presence makes many tasks difficult, if not impossible to solve, even in synchronous systems. In this paper, we introduce a new model for dynamic faults in synchronous distributed systems. This model includes as special cases the existing settings studied in the literature. We focus on the hardest setting of this model, called the simple threshold, where to be guaranteed that at least one message is delivered in a time step, the total number of transmitted messages in that time step must reach a threshold T@?c(G), where c(G) is the edge connectivity of the network. We investigate the problem of broadcasting under this model for the worst threshold T=c(G) in several classes of graphs, as well as in arbitrary networks. We design solution protocols, proving that broadcasting is possible even in this harsh environment. We analyze the time costs, showing that broadcasts can be completed in (low) polynomial time for several networks including rings (with or without knowledge of n), complete graphs (with or without a chordal sense of direction), hypercubes (with or without orientation), and constant-degree networks (with or without full topological knowledge).