Existing consensus protocols for synchronous distributed systems concentrate on the lower bound on the number of rounds required for achieving consensus. This paper proposes an approach to reduce the message complexity of some uniform consensus protocols significantly while achieving the same lower bound in which for any t-resilient consensus protocol only t + 1 processes engaging in sending messages in each round.Department of ComputingRefereed conference pape
Abstract When employing a consensus algorithm for state ma-chine replication, should one optimize fo...
In this paper we propose the mutable consensus proto-col, a pragmatic and theoretically appealing ap...
We consider the problem of consensus in the challenging classic model. In this model, the adversary ...
2003-2004 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe
Most existing consensus protocols for synchronous distributed systems are designed to tolerate crash...
In this paper, we discuss the consensus problem for synchronous distributed systems with orderly cra...
The goal of the consensus protocol is to make all non-faulty processors agree on a common value desp...
[[abstract]]The consensus problem in distributed systems is mainly solved by message exchange. Most ...
It is well known that the consensus problem can be solved in a distributed system if, after some tim...
Abstract. Consensus is a basic agreement problem whose solutions are funda-mental for building fault...
2006-2007 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe
The unbeatability of a consensus protocol, introduced by Halpern, Moses and Waarts in [14], is a str...
Abstract: In this paper, we offer new proofs to two lower bound results in distributed computing: a ...
Abstract — A fundamental problem of fault-tolerant distributed computing is for the reliable process...
The class of strong failure detectors (denoted S) includes all failure detectors that suspect all cr...
Abstract When employing a consensus algorithm for state ma-chine replication, should one optimize fo...
In this paper we propose the mutable consensus proto-col, a pragmatic and theoretically appealing ap...
We consider the problem of consensus in the challenging classic model. In this model, the adversary ...
2003-2004 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe
Most existing consensus protocols for synchronous distributed systems are designed to tolerate crash...
In this paper, we discuss the consensus problem for synchronous distributed systems with orderly cra...
The goal of the consensus protocol is to make all non-faulty processors agree on a common value desp...
[[abstract]]The consensus problem in distributed systems is mainly solved by message exchange. Most ...
It is well known that the consensus problem can be solved in a distributed system if, after some tim...
Abstract. Consensus is a basic agreement problem whose solutions are funda-mental for building fault...
2006-2007 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe
The unbeatability of a consensus protocol, introduced by Halpern, Moses and Waarts in [14], is a str...
Abstract: In this paper, we offer new proofs to two lower bound results in distributed computing: a ...
Abstract — A fundamental problem of fault-tolerant distributed computing is for the reliable process...
The class of strong failure detectors (denoted S) includes all failure detectors that suspect all cr...
Abstract When employing a consensus algorithm for state ma-chine replication, should one optimize fo...
In this paper we propose the mutable consensus proto-col, a pragmatic and theoretically appealing ap...
We consider the problem of consensus in the challenging classic model. In this model, the adversary ...