Agile Store: Experience with Quorum-Based Data Replication Techniques for Adaptive Byzantine Fault Tolerance

Kong, Lei; Manohar, D.J.; Subbiah, Arun; Sun, Mingxuan; Ahamad, Mustaque; Blough, Douglas M.

doi:10.1109/reldis.2005.7

Cited by 5 publications

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Write Markers for Probabilistic Quorum Systems

Merideth

Reiter

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Probabilistic quorum systems can tolerate a larger fraction of faults than can traditional (strict) quorum systems, while guaranteeing consistency with an arbitrarily high probability for a system with enough replicas. However, the masking and opaque types of probabilistic quorum systems are hampered in that their optimal load-a best-case measure of the work done by the busiest replica, and an indicator of scalability-is little better than that of strict quorum systems. In this paper we present a variant of probabilistic quorum systems that uses write markers in order to limit the extent to which Byzantine-faulty servers act together. Our masking and opaque probabilistic quorum systems have asymptotically better load than the bounds proven for previous masking and opaque quorum systems. Moreover, the new masking and opaque probabilistic quorum systems can tolerate an additional 24% and 17% of faulty replicas, respectively, compared with probabilistic quorum systems without write markers.

show abstract

Write Markers for Probabilistic Quorum Systems

Merideth

Reiter

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Dynamic-EC: an efficient dynamic erasure coding method for permissioned blockchain systems

Zhang,

Wu,

et al. 2024

Front. Comput. Sci.

View full text Add to dashboard Cite

Gumshoe: Diagnosing Performance Problems in Replicated File-Systems

Kavulya

Gandhi

Narasimhan

2008

2008 Symposium on Reliable Distributed Systems

View full text Add to dashboard Cite

Replicated file-systems can experience degraded performance that might not be adequately handled by the underlying fault-tolerant protocols. We describe the design and implementation of Gumshoe, a system that aims to diagnose performance problems in replicated file-systems. Gumshoe periodically gathers OS and protocol metrics and then analyzes these metrics to automatically localize the performance problem to the culprit node(s). We describe our results and experiences with problem diagnosis in two replicated file-systems (replicated-CoreFS and BFS) using two file-system benchmarks (Postmark and IOzone).

show abstract

Agile Store: Experience with Quorum-Based Data Replication Techniques for Adaptive Byzantine Fault Tolerance

Cited by 5 publications

References 16 publications

Write Markers for Probabilistic Quorum Systems

Write Markers for Probabilistic Quorum Systems

Dynamic-EC: an efficient dynamic erasure coding method for permissioned blockchain systems

Gumshoe: Diagnosing Performance Problems in Replicated File-Systems

Contact Info

Product

Resources

About