Sciweavers

219 search results - page 19 / 44
» Byzantine Quorum Systems
Sort
View
SOSP
2005
ACM
14 years 6 months ago
BAR fault tolerance for cooperative services
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement,...
MIDDLEWARE
2005
Springer
14 years 3 months ago
Dual-Quorum Replication for Edge Services
This paper introduces dual-quorum replication, a novel data replication algorithm designed to support Internet edge services. Dual-quorum replication combines volume leases and qu...
Lei Gao, Michael Dahlin, Jiandan Zheng, Lorenzo Al...
IJNSEC
2010
66views more  IJNSEC 2010»
13 years 4 months ago
Finding Traitors in Secure Networks Using Byzantine Agreements
Secure networks rely upon players to maintain security and reliability. However not every player can be assumed to have total loyalty and one must use methods to uncover traitors ...
Liam Wagner, Stuart McDonald
ICDCN
2010
Springer
13 years 8 months ago
K-Directory Community: Reliable Service Discovery in MANET
Abstract. Service discovery in MANET suffers from frequent service unavailability due to failures of service providers or directory nodes. Ensuring network-wide service availabilit...
Vaskar Raychoudhury, Jiannong Cao, Weigang Wu, Yi ...
ICDCS
2005
IEEE
14 years 3 months ago
A Dynamic Group Mutual Exclusion Algorithm Using Surrogate-Quorums
The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type with each critical section. In this problem, processes requesting critica...
Ranganath Atreya, Neeraj Mittal