Sciweavers

264 search results - page 31 / 53
» Bounding the number of tolerable faults in majority-based sy...
Sort
View
SRDS
1998
IEEE
15 years 4 months ago
Optimization of a Real-Time Primary-Backup Replication Service
The primary-backup replication model is one of the commonly adopted approaches to providing fault tolerant data services. Its extension to the real-time environment, however, impo...
Hengming Zou, Farnam Jahanian
CCGRID
2006
IEEE
15 years 5 months ago
Closing Cluster Attack Windows Through Server Redundancy and Rotations
— It is well-understood that increasing redundancy in a system generally improves the availability and dependability of the system. In server clusters, one important form of redu...
Yih Huang, David Arsenault, Arun Sood
DSN
2004
IEEE
15 years 3 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
CCS
2007
ACM
15 years 6 months ago
Robust group key agreement using short broadcasts
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
CORR
2006
Springer
85views Education» more  CORR 2006»
14 years 11 months ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil