Early Detection of Message Forwarding Faults

DOI10.1137/S0097539796312745MaRDI QIDQ4507389zbMATH OpenOpenAlexFDO

Authors Amir Herzberg, Shay Kutten

Publication date 18 October 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539796312745

zbMATH Keywords

competitive algorithmsdistributed algorithmsfault tolerancenetwork protocolsreal timetime adaptive

Mathematics Subject Classification ID

Network protocols (68M12) Nonnumerical algorithms (68W05)

Recommendations

• Message complexity versus space complexity in fault tolerant broadcast protocols
• Performing Work Efficiently in the Presence of Faults
• Performing work efficiently in the presence of faults
• Communication-optimal eventually perfect failure detection in partially synchronous systems
• scientific article; zbMATH DE number 1129898

Cited in

(5)

• On the bit security of cryptographic primitives
• Making Byzantine consensus live
• Computing scores of forwarding schemes in switched networks with probabilistic faults
• scientific article; zbMATH DE number 1129898 (Why is no real title available?)
• Protocols and Lower Bounds for Failure Localization in the Internet

This page was built for publication: Early Detection of Message Forwarding Faults

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