Implementing ♢P with Bounded Messages on a Network of ADD Channels

DOI10.1142/S0129626419500026zbMath1490.68048arXiv1708.02906OpenAlexW2944190086MaRDI QIDQ5087848

Saptaparni Kumar, Jennifer Lundelius Welch

Publication date: 4 July 2022

Published in: Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.02906

zbMATH Keywords

distributed computingfailure detectorADD channelspartitionable network

Mathematics Subject Classification ID

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

Related Items (1)

An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values

Cites Work

• Implementing unreliable failure detectors with unknown membership
• Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks
• The failure detector abstraction
• Eventually Perfect Failure Detectors Using ADD Channels
• Impossibility of distributed consensus with one faulty process
• Unreliable failure detectors for reliable distributed systems
• On the quality of service of failure detectors
• Perfect failure detection with very few bits

This page was built for publication: Implementing ♢P with Bounded Messages on a Network of ADD Channels