Publication

Modeling and validating the performance of atomic broadcast algorithms in high-latency networks

André Schiper
2007
Conference Papers

Abstract

The performance of consensus and atomic broadcast algorithms using failure detectors is often affected by a trade-off between the number of communication steps and the number of messages needed to reach a decision. In this paper, we model the performance of three consensus and atomic broadcast algorithms using failure detectors in the oft-neglected setting of wide area networks and validate this model by experimentally evaluating the algorithms in several different setups.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Modeling and validating the performance of atomic broadcast algorithms in high-latency networks

Chat with Graph Search

The Cost of Consistency: Submodular Maximization with Constant Recourse

Graph sparsification, sketching and adaptivity

Principles and Guidelines for Evaluating Social RobotNavigation Algorithms