Using adaptive timeouts to achieve at-most-once message delivery

DOI10.1007/s004460050013zbMath1448.68081OpenAlexW2036891293MaRDI QIDQ5137010

Soma Chaudhuri, Brian A. Coan, Jennifer Lundelius Welch

Publication date: 30 November 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004460050013

zbMATH Keywords

adaptive algorithmscommunication algorithmssynchronized clocksat-most-once message delivery

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

Solving the at-most-once problem with nearly optimal effectiveness

Cites Work

• Unnamed Item
• Synchronizing clocks in the presence of faults
• Time, clocks, and the ordering of events in a distributed system
• Practical uses of synchronized clocks in distributed systems

This page was built for publication: Using adaptive timeouts to achieve at-most-once message delivery