End-to-end consensus using end-to-end channels
Matthias Wiesmann, Xavier Défago
Abstract
Matthias Wiesmann, Xavier Défago
Abstract
End-to-end consensus ensures delivery of the same value to the application layer running in distributed processes. Deliveries that have not been acknowledged by the application before a failure are delivered again. End-to-end primitives are important for applications that need to enforce persistency. We present an algorithm that solves the end-to-end consensus problem. Our approach is to build end-to-end consensus using a new type of communication channels, end-to-end channels
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
End-to-end consensus ensures delivery of the same value to the application layer running in distributed processes. Deliveries that have not been acknowledged by the application before a failure are delivered again. End-to-end primitives are important for applications that need to enforce persistency. We present an algorithm that solves the end-to-end consensus problem. Our approach is to build end-to-end consensus using a new type of communication channels, end-to-end channels
Key concepts: End-to-end principle, Dead end, End user, Computer science, Computer network, End of history, Distributed computing, Mathematics