An eventually perfect failure detector for networks of arbitrary topology connected with ADD channels using time-to-live values

DOI10.1142/S0129626420500061zbMATH Open1490.68057OpenAlexW3042711301MaRDI QIDQ5087072FDOQ5087072

Authors: Karla Vargas, Sergio Rajsbaum, Michel Raynal 

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

Recommendations

• Eventually Perfect Failure Detectors Using ADD Channels
• Implementing \(\lozenge P\) with bounded messages on a network of ADD channels
• Perfect failure detection with very few bits
• Perfect failure detection with very few bits
• Brief Announcement: Leader Election in the ADD Communication Model

zbMATH Keywords

failure detectorADD channelarbitrarily connected networktime-to-live value

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Unreliable failure detectors for reliable distributed systems
• Title not available (Why is that?)
• The Weakest Failure Detectors to Boost Obstruction-Freedom
• Title not available (Why is that?)
• Implementing unreliable failure detectors with unknown membership
• Eventually Perfect Failure Detectors Using ADD Channels
• On the hardness of failure-sensitive agreement problems.
• Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks
• Fault-tolerant message-passing distributed systems. An algorithmic approach
• Crash-Quiescent Failure Detection
• On Quiescent Reliable Communication
• Wait-Free Dining Under Eventual Weak Exclusion
• Implementing \(\lozenge P\) with bounded messages on a network of ADD channels

Cited In (3)

• Perfect failure detection with very few bits
• Eventually Perfect Failure Detectors Using ADD Channels
• Implementing \(\lozenge P\) with bounded messages on a network of ADD channels

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087072)