André Schiper

Related publications (58)

About
Privacy
Disclaimer

Graph Chatbot

The impact of mobility on the time complexity for deterministic broadcasting in radio networks

We study the time complexity for deterministic broadcasting algorithms in mobile radio networks. The broadcast operation consists of a source node successfully communicating its message to every other node. In multi-hop radio networks such as MANETs, the m ...

2011

On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults

André Schiper, Martin Hutle, Zarko Milosevic

We investigate the reduction of atomic broadcast to consensus in systems with Byzantine faults. Among the several definitions of Byzantine consensus that differ only by their validity property, we identify those equivalent to atomic broadcast. Finally, we ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2011

Stabilization, Safety and Security Preface

André Schiper

2011

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran

We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We show that for \emph{the algorithms we analyzed}, in most cases, the decentralized ...

IEEE2011

Swift Algorithms for Repeated Consensus

André Schiper, Martin Hutle, Fatemeh Borran, Nuno Filipe de Sousa Santos

We introduce the notion of a swift algorithm. Informally, an algorithm that solves the repeated consensus is swift if, in a partial synchronous run of this algorithm, eventually no timeout expires, i.e., the algorithm execution proceeds with the actual spe ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2010

A Leader-Free Byzantine Consensus Algorithm

André Schiper, Fatemeh Borran

The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorithms that solve consensus with Byzantine faults are leader-based. This is not ...

Springer-Verlag2010

A Leader-Free Byzantine Consensus Algorithm

André Schiper, Fatemeh Borran

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Generic construction of consensus algorithms for benign and Byzantine faults

André Schiper, Zarko Milosevic, Olivier Rütti

The paper proposes a generic consensus algorithm that highlights the basic and common features of known consensus algorithms. The parameters of the generic algorithm encapsulate the core differences between various consensus algorithms, including leader-ba ...

2010

Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency

André Schiper, Martin Hutle, Zarko Milosevic

The paper considers the consensus problem in a partially synchronous system with Byzantine processes. In this context, the literature distinguishes authenticated Byzantine faults, where messages can be signed by the sending process (with the assumption tha ...

Springer-Verlag2009

The Heard-Of model: computing in distributed systems with benign faults

André Schiper

Problems in fault-tolerant distributed computing have been studied in a variety of models. These models are structured around two central ideas: (1) degree of synchrony and failure model are two independent parameters that determine a particular type of sy ...

Springer Verlag2009

Page 3 of 6