Zyzzyva: Speculative Byzantine fault tolerance
暂无分享,去创建一个
[1] Jason Flinn,et al. Tolerating Latency in Replicated State Machines Through Client Speculation , 2009, NSDI.
[2] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[3] Michael Dahlin,et al. BAR fault tolerance for cooperative services , 2005, SOSP '05.
[4] Arun Venkataramani,et al. Separating agreement from execution for byzantine fault tolerant services , 2003, SOSP '03.
[5] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[6] Miguel Castro,et al. Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.
[7] Dawn M. Cappelli,et al. Insider Threat Study: Computer System Sabotage in Critical Infrastructure Sectors , 2005 .
[8] Petr Kuznetsov,et al. Zeno: Eventually Consistent Byzantine-Fault Tolerance , 2009, NSDI.
[9] Norman C. Hutchinson,et al. Deciding when to forget in the Elephant file system , 1999, SOSP.
[10] Mihir Bellare,et al. A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost , 1997, EUROCRYPT.
[11] Ramakrishna Kotla,et al. High throughput Byzantine fault tolerance , 2004, International Conference on Dependable Systems and Networks, 2004.
[12] David Mazières,et al. Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems , 2007, NSDI.
[13] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.
[14] Atul Singh,et al. BFT Protocols Under Fire , 2008, NSDI.
[15] Ramakrishna Kotla,et al. Zyzzyva: speculative byzantine fault tolerance , 2007, TOCS.
[16] Miguel Oom Temudo de Castro,et al. Practical Byzantine fault tolerance , 1999, OSDI '99.
[17] Fred B. Schneider,et al. Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.
[18] Michael Dahlin,et al. Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults , 2009, NSDI.
[19] Michael Williams,et al. Replication in the harp file system , 1991, SOSP '91.
[20] Leslie Lamport,et al. Using Time Instead of Timeout for Fault-Tolerant Distributed Systems. , 1984, TOPL.
[21] Andrea C. Arpaci-Dusseau,et al. IRON file systems , 2005, SOSP '05.
[22] Ramakrishna Kotla,et al. SafeStore: A Durable and Practical Storage System , 2007, USENIX Annual Technical Conference.
[23] Maurice Herlihy,et al. Linearizability: a correctness condition for concurrent objects , 1990, TOPL.
[24] Jean-Philippe Martin,et al. Fast Byzantine Consensus , 2006, IEEE Trans. Dependable Secur. Comput..
[25] Leslie Lamport. Lower bounds for asynchronous consensus , 2003 .
[26] Michael K. Reiter,et al. Fault-scalable Byzantine fault-tolerant services , 2005, SOSP '05.
[27] Sangmin Lee,et al. Upright cluster services , 2009, SOSP '09.
[28] Junfeng Yang,et al. EXPLODE: a lightweight, general system for finding serious storage system errors , 2006, OSDI '06.
[29] Miguel Castro,et al. BASE: using abstraction to improve fault tolerance , 2001, SOSP.
[30] Liuba Shrira,et al. HQ replication: a hybrid quorum protocol for byzantine fault tolerance , 2006, OSDI '06.
[31] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.
[32] Jason Flinn,et al. Rethink the sync , 2006, OSDI '06.
[33] Miguel Castro,et al. Proactive recovery in a Byzantine-fault-tolerant system , 2000, OSDI.
[34] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.
[35] Scott Shenker,et al. Attested append-only memory: making adversaries stick to their word , 2007, SOSP.
[36] Ramakrishna Kotla,et al. Xbft: byzantine fault tolerance with high performance, low cost, and aggressive fault isolation , 2008 .
[37] Michael K. Reiter,et al. The Rampart Toolkit for Building High-Integrity Services , 1994, Dagstuhl Seminar on Distributed Systems.