Deterministic Models of Communication Faults
From MaRDI portal
Recommendations
- Communication in Networks with Random Dependent Faults
- Model of error propagation in systems of communicating processes
- Communication-optimal eventually perfect failure detection in partially synchronous systems
- Verification of probabilistic systems with faulty communication
- scientific article; zbMATH DE number 1956504
- Communication structures in fault‐tolerant distributed systems
- Probabilistic verification of communication protocols
- Deterministic communication in radio networks
Cites work
- scientific article; zbMATH DE number 1696680 (Why is no real title available?)
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 732976 (Why is no real title available?)
- scientific article; zbMATH DE number 857072 (Why is no real title available?)
- scientific article; zbMATH DE number 961881 (Why is no real title available?)
- A note on optimal time broadcast in faulty hypercubes
- A survey of gossiping and broadcasting in communication networks
- Adaptive broadcasting with faulty nodes
- Almost Safe Gossiping in Bounded Degree Networks
- Broadcasting in a hypercube when some calls fail
- Broadcasting in complete networks with faulty nodes using unreliable calls
- Broadcasting in hypercubes and star graphs with dynamic faults.
- Broadcasting in synchronous networks with dynamic faults
- Broadcasting with linearly bounded transmission faults
- Broadcasting with locally bounded byzantine faults
- Broadcasting with random faults
- Communication complexity of fault-tolerant information diffusion
- Communication in Networks with Random Dependent Faults
- Deterministic Models of Communication Faults
- Diameter increase caused by edge deletion
- Directed virtual path layouts in ATM networks
- Dynamic faults have small effect on broadcasting in hypercubes.
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- Fault tolerance of the star graph interconnection network
- Fault tolerant routing in the star and pancake interconnection networks
- Fault-tolerant broadcasting and gossiping in communication networks
- Feasibility and complexity of broadcasting with random transmission failures
- Impossibility of distributed consensus with one faulty process
- Information dissemination in distributed systems with faulty units
- Methods and problems of communication in usual networks
- Minimum time broadcast in faulty star networks
- On Fractional Dynamic Faults with Threshold
- On optimal broadcasting in faulty hypercubes
- On the fault-diameter of the star graph
- Optimal broadcasting in hypercubes with dynamic faults
- Optimal graph exploration without good maps
- Rapid Almost-Complete Broadcasting in Faulty Networks
- Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
- Reliable broadcasting
- SOFSEM 2006: Theory and Practice of Computer Science
- Sense of direction: Definitions, properties, and classes
- The minimal entropy martingale measure and the valuation problem in incomplete markets
- Unreliable failure detectors for reliable distributed systems
Cited in
(2)
This page was built for publication: Deterministic Models of Communication Faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599115)
