Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast | Zendy

Marcos K. Aguilera | Zendy; Sam Toueg | Zendy; Borislav Deianov | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast

Author(s) -

Marcos K. Aguilera,

Sam Toueg,

Borislav Deianov

Publication year - 1999

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-66531-5

DOI - 10.1007/3-540-48169-9_2

Subject(s) - computer science , asynchronous communication , atomic broadcast , lossy compression , process (computing) , enhanced data rates for gsm evolution , detector , message passing , distributed computing , theoretical computer science , algorithm , computer network , broadcasting (networking) , telecommunications , artificial intelligence , programming language

Uniform Reliable Broadcast (URB) is a communication primitive that requires that if a process delivers a message, then all correct processes also deliver this message. A recent paper [HR99] uses Knowledge Theory to determine what failure detectors are necessary to implement this primitive in asynchronous systems with process crashes and lossy links that are fair. In this paper, we revisit this problem using a different approach, and provide a result that is simpler, more intuitive, and, in a precise sense, more general.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research