An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values
From MaRDI portal
Publication:5087072
DOI10.1142/S0129626420500061zbMath1490.68057OpenAlexW3042711301MaRDI QIDQ5087072
Michel Raynal, Sergio Rajsbaum, Karla Vargas
Publication date: 8 July 2022
Published in: Parallel Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129626420500061
Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Implementing unreliable failure detectors with unknown membership
- Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks
- On the hardness of failure-sensitive agreement problems.
- Eventually Perfect Failure Detectors Using ADD Channels
- The Weakest Failure Detectors to Boost Obstruction-Freedom
- Crash-Quiescent Failure Detection
- Unreliable failure detectors for reliable distributed systems
- On Quiescent Reliable Communication
- Implementing ♢P with Bounded Messages on a Network of ADD Channels
- Fault-Tolerant Message-Passing Distributed Systems
- Wait-Free Dining Under Eventual Weak Exclusion
This page was built for publication: An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values