Sciweavers

219 search results - page 11 / 44
» Byzantine Quorum Systems
Sort
View
SRDS
2003
IEEE
14 years 3 months ago
Sharing Memory with Semi-Byzantine Clients and Faulty Storage Servers
This paper presents fault-tolerant simulations of a single-writer multi-reader regular register in storage systems. One simulation tolerates fail-stop failures of storage servers ...
Hagit Attiya, Amir Bar-Or
ICDCS
1997
IEEE
14 years 2 months ago
Two New Quorum Based Algorithms for Distributed Mutual Exclusion
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modi cation of Maekawa's grid based quorum scheme. The size of ...
Wai-Shing Luk, Tien-Tsin Wong
EUROSYS
2007
ACM
14 years 7 months ago
Antiquity: exploiting a secure log for wide-area distributed storage
Antiquity is a wide-area distributed storage system designed to provide a simple storage service for applications like file systems and back-up. The design assumes that all serve...
Hakim Weatherspoon, Patrick R. Eaton, Byung-Gon Ch...
OPODIS
2007
13 years 11 months ago
Making Distributed Applications Robust
We present a novel translation of systems that are tolerant of crash failures to systems that are tolerant of Byzantine failures in an asynchronous environment, making weaker assum...
Chi Ho, Danny Dolev, Robbert van Renesse
ADHOC
2007
169views more  ADHOC 2007»
13 years 10 months ago
Ensuring strong data guarantees in highly mobile ad hoc networks via quorum systems
Ensuring the consistency and the availability of replicated data in highly mobile ad hoc networks is a challenging task because of the lack of a backbone infrastructure. Previous ...
Daniela Tulone