Telephone problems with failures
SIAM Journal on Algebraic and Discrete Methods
On induced subgraphs of the cube
Journal of Combinatorial Theory Series A
Broadcasting in complete networks with faulty nodes using unreliable recalls
Information Processing Letters
Almost safe gossiping in bounded degree networks
SIAM Journal on Discrete Mathematics
Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers
IEEE Transactions on Computers
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
On the impact of sense of direction on message complexity
Information Processing Letters
Broadcasting with linearly bounded transmission faults
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Optimal broadcasting in hypercubes with dynamic faults
Information Processing Letters
Self-stabilization
ACM Transactions on Computer Systems (TOCS)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Information Dissemination in Distributed Systems with Faulty Units
IEEE Transactions on Computers
Sense of Direction in Distributed Computing
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Distributed Function Evaluation in the Presence of Transmission Faults
SIGAL '90 Proceedings of the International Symposium on Algorithms
Recovery scenario for a DB/DC system
ACM '73 Proceedings of the ACM annual conference
Using Broadcast Primitives in Replicated Databases
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
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
CernVM-FS: delivering scientific software to globally distributed computing resources
Proceedings of the first international workshop on Network-aware data management
| Hi-index | 5.23 |
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other vertices as fast as possible. The model of fractional dynamic faults with threshold is considered: in every step either a fixed number c(G)-1, where c(G) is the edge connectivity of the communication graph, or a fraction @a of sent messages can be lost depending on which quantity is larger. As the main result we show that in complete graphs and hypercubes it is possible to inform all but a constant number of vertices, exhibiting only a logarithmic slowdown, i.e. in time O(Dlogn) where D is the diameter of the network and n is the number of vertices. Moreover, for complete graphs under some additional conditions (sense of direction, or @a