Message complexity versus space complexity in fault tolerant broadcast protocols
From MaRDI portal
Recommendations
- Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures
- A trade-off between information and communication in broadcast protocols
- scientific article; zbMATH DE number 4062584
- Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
- Reliable broadcasts and communication models: tradeoffs and lower bounds
Cited in
(12)- Reliable broadcasts and communication models: tradeoffs and lower bounds
- On the total\(_k\)-diameter of connection networks
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
- Expected reliability of communication protocols
- k-robust single-message transmission
- On exponential lower bound for protocols for reliable communication in networks
- Space-efficient and fault-tolerant message routing in outerplanar networks
- Communication-Space Tradeoffs for Unrestricted Protocols
- Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures
- Early Detection of Message Forwarding Faults
- On the complexity of global computation in the presence of link failures: the case of uni-directional faults
- Graph Minors and Reliable Single Message Transmission
This page was built for publication: Message complexity versus space complexity in fault tolerant broadcast protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4730761)
