Contention-Aware Metrics for Distributed Algorithms: Comparison of Atomic Broadcast Algorithms
Related publications (32)
Graph Chatbot
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.
We formulate and study distributed estimation algorithms based on diffusion protocols to implement cooperation among individual adaptive nodes. The individual nodes are equipped with local learning abilities. They derive local estimates for the parameter o ...
Institute of Electrical and Electronics Engineers2008
Comparative Performance Analysis of Ordering Strategies in Atomic Broadcast Algorithms Xavier Defago, Andre Schiper, Peter Urban In this paper, we present the results of a comparative analysis of Atomic Broadcast algorithms. The analysis was done by using ...
Nowadays, networked computers are present in most aspects of everyday life. Moreover, essential parts of society come to depend on distributed systems formed of networked computers, thus making such systems secure and fault tolerant is a top priority. If t ...
Many envisioned applications of ad hoc networks involve only small-scale networks that we term Vicinity Ad-hoc Groups (VAGs). Distributed coordination services, instead of pairwise communications, are the primary requirements of VAGs. Existing designs for ...
Distributed adaptive algorithms are proposed to address the problem of estimation in distributed networks. We extend recent work by relying on static and adaptive diffusion strategies. The resulting adaptive networks are robust to node and link failures an ...
The key principles behind current peer-to-peer research include fully distributing service functionality among all nodes participating in the system and routing individual requests based on a small amount of locally maintained state. The goals extend much ...
Peter Urban, Xavier Defago and Andre Schiper Neko: A Single Environment to Simulate and Prototype Distributed Algorithms Designing, tuning, and analyzing the performance of distributed algorithms and protocols are complex tasks. A major factor that contrib ...
In a distributed application, high-availability of a critical online service is ensured despite failures by duplicating the vital components of the server. Whilst guaranteeing the access to the server at all times, duplication requires particular care, so ...
A. Coccoli, P. Urban, A. Bondavalli, and A. Schiper. Performance analysis of a consensus algorithm combining Stochastic Activity Networks and measurements. In Proc. Int'l Conf. on Dependable Systems and Networks (DSN), pages 551-560, Washington, DC, USA, J ...
Self limiting epidemic forwarding is a method of epidemic information dissemination in wireless ad-hoc networks that achieves congestion control by limiting spread (i.e. the number of nodes that receive a given message) and injection rate in order to prese ...
