Sciweavers

46 search results - page 2 / 10
» Dynamic Byzantine Quorum Systems
Sort
View
DSN
2004
IEEE
13 years 8 months ago
A Framework for Dynamic Byzantine Storage
We present a framework for transforming several quorum-based protocols so that they can dynamically adapt their failure threshold and server count, allowing them to be reconfigure...
Jean-Philippe Martin, Lorenzo Alvisi
DSN
2002
IEEE
13 years 9 months ago
Small Byzantine Quorum Systems
In this paper we present two protocols for asynchronous Byzantine Quorum Systems (BQS) built on top of reliable channels—one for self-verifying data and the other for any data. ...
Jean-Philippe Martin, Lorenzo Alvisi, Michael Dahl...
OTM
2009
Springer
13 years 11 months ago
Proactive Byzantine Quorum Systems
Byzantine Quorum Systems is a replication technique used to ensure availability and consistency of replicates data even in presence of arbitrary faults. This paper presents a Byzan...
Eduardo Adílio Pelinson Alchieri, Alysson N...
OPODIS
2007
13 years 6 months ago
Timed Quorum Systems for Large-Scale and Dynamic Environments
This paper presents Timed Quorum System (TQS), a quorum system for large-scale and dynamic systems. TQS provides guarantees that two quorums, accessed at instances of time that are...
Vincent Gramoli, Michel Raynal
ICALP
2004
Springer
13 years 10 months ago
Group Spreading: A Protocol for Provably Secure Distributed Name Service
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
Baruch Awerbuch, Christian Scheideler