Publication

Optimistic Atomic Broadcast: A Pragmatic Viewpoint

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.

The scaling of the broadcast capacity of extended wireless networks with cooperative relays

Michael Christoph Gastpar

We study the scaling of the broadcast capacity for a network with a single source and f(N) cooperative relays where N is the number of destinations and f(.) is an increasing function. We consider random extended networks (the network area goes to infinity ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Atomic broadcast

Nils Richard Ekwall

Within only a couple of generations, the so-called digital revolution has taken the world by storm: today, almost all human beings interact, directly or indirectly, at some point in their life, with a computer system. Computers are present on our desks, co ...

EPFL2007

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

André Schiper, Nils Richard Ekwall

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 o ...

Springer2007

Comparing Atomic Broadcast Algorithms in High Latency Networks

André Schiper, Nils Richard Ekwall

Since the introduction of the concept of failure detectors, several consensus and atomic broadcast algorithms based on these detectors have been published. The performance of these algorithms is often affected by a trade-off between the number of communica ...

2006

Communication Infrastructure Design for Wide-Area Mobile Computation: Specification in Nomadic Pict

We review an example of wide-area mobile agent applications: video-on-demand, long-lived scientific computation, and collaborative work, and the design of a distributed infrastructure required in each of these applications for location-independent communic ...

2005

Optimistic atomic broadcast: a pragmatic viewpoint

André Schiper, Fernando Pedone

Optimistic atomic broadcast: a pragmatic viewpoint F.Pedone and A.Schiper This paper presents the Optimistic Atomic Broadcast algorithm (OPT-ABcast) which exploits the spontaneous total-order property experienced in local-area networks in order to allow fa ...

2003

Evaluating the performance of distributed agreement algorithms

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 ...

EPFL2003

Video Multicast in (large) local area networks

Martin Vetterli, Jean-Paul Wagner

We consider the problem of distributing high-quality video signals over IP multicast in large Local Area Networks (LANs), under real-time delay constraints, and with software-only processing. In a large LAN (such as the network of a university campus, or t ...

2002

System and method for generating and maintaining a relative positioning system without GPS

Martin Vetterli, Jean-Pierre Hubaux, Srdan Capkun

NOVELTY - At least some of wireless terminals can communicate over wireless links (2) in one or several hops with at least some of the other wireless terminals. The distances (dij) to one-hop neighbors may be measured in a number of the wireless terminals ...

2001

Issues on Mobile Ad-Hoc WANs

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Ljubica Blazevic

In this paper we present the main challenges in mobile ad-hoc wide area networks (MAWANs). A MAWAN is a wide area, large, (potentially) entirely wireless networks. We describe the Terminodes Project (a 10-year-long research program (2000-2010) in MAWANs, s ...

2000