, Fault-scalable Byzantine fault-tolerant services, SOSP, 2005.
, Abortable and query-abortable objects and their efficient implementation, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, 2007.
DOI : 10.1145/1281100.1281107
, The spread toolkit: Architecture and performance, pp.2004-2005, 2004.
, The Totem single-ring ordering and membership protocol, ACM Transactions on Computer Systems, vol.13, issue.4, pp.311-342, 1995.
DOI : 10.1145/210223.210224
, Customizable Fault Tolerance for Wide-Area Replication, Proceedings of the International Symposium on Reliable Distributed Systems (SRDS), pp.65-82, 2007.
, Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks, IEEE Transactions on Dependable and Secure Computing, vol.7, issue.1, pp.80-93, 2010.
DOI : 10.1109/TDSC.2008.53
, A lightweight solution to uniform atomic broadcast for asynchronous systems, Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing, 1997.
DOI : 10.1109/FTCS.1997.614102
, Multicast transport protocol, RFC 1301, 1992.
DOI : 10.17487/rfc1301
, Computing with Reads and Writes in the Absence of Step Contention, DISC, 2005.
DOI : 10.1007/11561927_11
, Efficient system-enforced deterministic parallelism, Proceedings of the International Symposium on Operating Systems Design and Implementation (OSDI), 2010.
DOI : 10.1145/2160718.2160742
, A classification of total order specifications and its application to fixed sequencer-based implementations, Journal of Parallel and Distributed Computing, vol.66, issue.1, 2006.
DOI : 10.1016/j.jpdc.2005.06.021
, TERA, Proceedings of the 2007 inaugural international conference on Distributed event-based systems , DEBS '07, pp.2-13, 2007.
DOI : 10.1145/1266894.1266898
, Unconscious Eventual Consistency with Gossips, Proceedings of the International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp.65-81, 2006.
DOI : 10.1007/978-3-540-49823-0_5
, Designing broadcasting algorithms in the postal model for message-passing systems, Mathematical Systems Theory, vol.83, issue.No. 9, pp.431-452, 1994.
DOI : 10.1007/BF01184933
, Multiple message broadcasting in the postal model, Networks, vol.29, issue.1, pp.1-10, 1997.
DOI : 10.1002/(SICI)1097-0037(199701)29:1<1::AID-NET1>3.0.CO;2-P
, Adrian Schüpbach, and Akhilesh Singhania. The multikernel: a new OS architecture for scalable multicore systems, Proceedings of the International Symposium on Operating Systems Principles (SOSP), pp.29-44, 2009.
, Concurrency Control and Recovery in Database Systems, 1987.
, Exploiting virtual synchrony in distributed systems, Proceedings of the eleventh ACM Symposium on Operating systems principles (SOSP'87), pp.123-138, 1987.
, Reliable communication in the presence of failures, ACM Transactions on Computer Systems, vol.5, issue.1, pp.47-76, 1987.
DOI : 10.1145/7351.7478
, Reliable Distributed Computing with the Isis Toolkit, 1993.
, Deconstructing paxos, ACM SIGACT News, vol.34, issue.1, pp.47-67, 2003.
DOI : 10.1145/637437.637447
, Consensus in one communication step, PaCT, 2001.
, The FRACTAL component model and its support in Java, Software ? Practice and Experience (SP&E), pp.11-121257, 2006.
DOI : 10.1002/spe.767
, Secure and Efficient Asynchronous Broadcast Protocols, 2001.
DOI : 10.1007/3-540-44647-8_31
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.5602
, The tandem global update protocol, Tandem Syst. Rev, vol.1, pp.74-85, 1985.
, Practical Byzantine fault tolerance, OSDI, 1999.
, Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996.
DOI : 10.1145/226643.226647
, Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996.
DOI : 10.1145/226643.226647
, Paxos made live: an engineering perspective, PODC, 2007.
, Reliable broadcast protocols, ACM Transactions on Computer Systems, vol.2, issue.3, pp.251-273, 1984.
DOI : 10.1145/989.357400
, Abortable consensus and its application to probabilistic atomic broadcast, 2007.
, Diverse Replication for Single- Machine Byzantine-Fault Tolerance, Proceedings of the USENIX Annual Technical Conference, pp.287-292, 2008.
, Attested append-only memory: making adversaries stick to their word, Proceedings of the International Symposium on Operating Systems Principles (SOSP), pp.189-204, 2007.
, Making Byzantine fault tolerant systems tolerate Byzantine faults, NSDI, 2009.
, How to tolerate half less one Byzantine nodes in practical distributed systems, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004., pp.174-183, 2004.
DOI : 10.1109/RELDIS.2004.1353018
, From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures, The Computer Journal, vol.49, issue.1, pp.82-96, 2006.
DOI : 10.1093/comjnl/bxh145
, HQ replication: A hybrid quorum protocol for Byzantine fault tolerance, OSDI, 2006.
, Asynchronous atomic broadcast, IBM Technical Disclosure Bulletin, vol.33, issue.9, pp.115-116, 1991.
, High-performance asynchronous atomic broadcast, Distributed Systems Engineering, vol.4, issue.2, pp.109-128, 1997.
DOI : 10.1088/0967-1846/4/2/005
, LogP: Towards a realistic model of parallel computation, Principles Practice of Parallel Programming, pp.1-12, 1993.
, Comparative performance analysis of ordering strategies in atomic broadcast algorithms, IEICE Trans. on Information and Systems, issue.12, pp.86-2698, 2003.
, Total order broadcast and multicast algorithms, ACM Computing Surveys, vol.36, issue.4, pp.372-421, 2004.
DOI : 10.1145/1041680.1041682
, One-step Consensus with Zero-Degradation, International Conference on Dependable Systems and Networks (DSN'06), 2006.
DOI : 10.1109/DSN.2006.55
, Abstractions for devising Byzantine-resilient state machine replication, Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000, 2000.
DOI : 10.1109/RELDI.2000.885402
, Fuse: Lightweight guaranteed distributed failure notification, Proceedings of 6th Symposium on Operating Systems Design and Implementation (OSDI '04), 2004.
, Token-based atomic broadcast using unreliable failure detectors, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004., pp.52-65, 2004.
DOI : 10.1109/RELDIS.2004.1353003
, Newtop: a fault-tolerant group communication protocol, Proceedings of 15th International Conference on Distributed Computing Systems, 1995.
DOI : 10.1109/ICDCS.1995.500032
, Maxime Monod, and Vivien Quéma. Heterogeneous gossip, Proceedings of the International Conference on Middleware (Middleware), pp.42-61, 2009.
, Stretching gossip with live streaming, 2009 IEEE/IFIP International Conference on Dependable Systems & Networks, 2009.
DOI : 10.1109/DSN.2009.5270330
URL : https://hal.archives-ouvertes.fr/inria-00436130
, Packing messages as a tool for boosting the performance of total ordering protocls, Proceedings of the 6th International Symposium on High Performance Distributed Computing (HPDC '97), 1997.
, Packing messages as a tool for boosting the performance of total ordering protocls, HPDC '97: Proceedings of the 6th IEEE International Symposium on High Performance Distributed Computing, p.233, 1997.
, Consensus-based fault-tolerant total order multicast, IEEE Transactions on Parallel and Distributed Systems, vol.12, issue.2, pp.147-156, 2001.
DOI : 10.1109/71.910870
, Ordered and reliable multicast communication, ACM Transactions on Computer Systems, vol.9, issue.3, pp.242-271, 1991.
DOI : 10.1145/128738.128741
, Efficient Workstealing for Multicore Event-Driven Systems, 2010 IEEE 30th International Conference on Distributed Computing Systems, pp.516-525, 2010.
DOI : 10.1109/ICDCS.2010.55
URL : https://hal.archives-ouvertes.fr/hal-00945722
, Reliable broadcast in synchronous and asynchronous environments (preliminary version), Proceedings of the 3rd International Workshop on Distributed Algorithms, pp.110-123, 1989.
DOI : 10.1007/3-540-51687-5_36
, Notes on database operating systems, Operating Systems ? An Advanced Course, number 66, 1978.
, The next 700 BFT protocols, Proceedings of the 5th European conference on Computer Systems (EuroSys), pp.363-376, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00945717
, A High Throughput Atomic Storage Algorithm, 27th International Conference on Distributed Computing Systems (ICDCS '07), 2007.
DOI : 10.1109/ICDCS.2007.80
, High Throughput Total Order Broadcast for Cluster Environments, International Conference on Dependable Systems and Networks (DSN'06), 2006.
DOI : 10.1109/DSN.2006.37
, Throughput optimal total order broadcast for cluster environments, ACM Transactions on Computer Systems, vol.28, issue.2, pp.1-32, 2010.
DOI : 10.1145/1813654.1813656
URL : https://hal.archives-ouvertes.fr/hal-00945800
, Fault-tolerant broadcasts and related problems, pp.97-145, 1993.
, An evaluation of the Amoeba group communication system, Proceedings of 16th International Conference on Distributed Computing Systems, 1996.
DOI : 10.1109/ICDCS.1996.507992
, NATresilient Gossip Peer Sampling, Proceedings of the International Conference on Distributed Computing Systems (ICDCS), 2009.
URL : https://hal.archives-ouvertes.fr/hal-00945700
, A total ordering protocol using a dynamic token-passing scheme, Distributed Systems Engineering, vol.4, issue.2, pp.87-95, 1997.
DOI : 10.1088/0967-1846/4/2/003
, Zyzzyva: speculative Byzantine fault tolerance, SOSP, 2007.
, High throughput Byzantine fault tolerance, International Conference on Dependable Systems and Networks, 2004, pp.575-584, 2004.
DOI : 10.1109/DSN.2004.1311928
, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, 1978.
DOI : 10.1145/359545.359563
, Lower bounds for asynchronous consensus, FuDiCo, 2003.
, Hints for computer system design, SOSP, pp.33-48, 1983.
, Supporting Heterogeneous Architecture Descriptions in an Extensible Toolset, Proceedings of the International Conference on Software Engineering (ICSE), 2007.
, The complexity of reliable distributed storage, 2008.
, Have things changed now?, Proceedings of the 1st workshop on Architectural and system support for improving software dependability , ASID '06, pp.25-33, 2006.
DOI : 10.1145/1181309.1181314
, A fault-tolerant protocol for atomic broadcast, IEEE Transactions on Parallel and Distributed Systems, vol.1, issue.3, pp.271-285, 1990.
DOI : 10.1109/71.80156
, Distributed Algorithms, 1996.
, Numerical performability evaluation of a group multicast protocol, Distributed Systems Engineering, vol.3, issue.1, pp.39-52, 1996.
DOI : 10.1088/0967-1846/3/1/006
, Mencius: Building Efficient Replicated State Machine for WANs, Proceedings of the International Symposium on Operating Systems Design and Implementation (OSDI), pp.369-384, 2008.
, Building secure file systems out of byzantine storage, Proceedings of the twenty-first annual symposium on Principles of distributed computing , PODC '02, pp.108-117, 2002.
DOI : 10.1145/571825.571840
, FireSpam: Spam Resilient Gossiping in the BAR Model, 2010 29th IEEE Symposium on Reliable Distributed Systems, 2010.
DOI : 10.1109/SRDS.2010.33
URL : https://hal.archives-ouvertes.fr/hal-00945724
, Asynchronous Fault-Tolerant Total Ordering Algorithms, SIAM Journal on Computing, vol.22, issue.4, pp.727-750, 1993.
DOI : 10.1137/0222048
, Ordered broadcasts for large applications, [1991] Proceedings Tenth Symposium on Reliable Distributed Systems, pp.188-197, 1991.
DOI : 10.1109/RELDIS.1991.145423
, Boosting system performance with optimistic distributed protocols, Computer, vol.34, issue.12, pp.80-86, 2001.
DOI : 10.1109/2.970581
, Preserving and using context information in interprocess communication, ACM Transactions on Computer Systems, vol.7, issue.3, pp.217-246, 1989.
DOI : 10.1145/65000.65001
, Implementing fault-tolerant services using the state machine approach: a tutorial, ACM Computing Surveys, vol.22, issue.4, pp.299-319, 1990.
DOI : 10.1145/98163.98167
, BFT protocols under fire, NSDI, 2008.
, Nonblocking commit protocols A Users Guide to Spread, Proceedings of the ACM SIGMOD International Conference on Management of Data, pp.133-142, 1981.
, Managing update conflicts in Bayou, a weakly connected replicated storage system, Proceedings of the International Symposium on Operating Systems Principles (SOSP), pp.172-182, 1995.
, Contention-aware metrics for distributed algorithms: comparison of atomic broadcast algorithms, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440), pp.582-589, 2000.
DOI : 10.1109/ICCCN.2000.885548
, Chain replication for supporting high throughput and availability, OSDI'04: Proceedings of the 6th conference on Symposium on Operating Systems Design & Implementation, pp.7-7, 2004.
, Chain replication for supporting high throughput and availability, OSDI, 2004.
, An indulgent uniform total order algorithm with optimistic delivery, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings., 2002.
DOI : 10.1109/RELDIS.2002.1180177
, Abstractions for asynchronous distributed computing with malicious players, 2008.
, A high performance totally ordered multicast protocol, Selected Papers from the International Workshop on Theory and Practice in Distributed Systems, pp.33-57, 1994.
DOI : 10.1007/3-540-60042-6_3
, A hierarchy of totally ordered multicasts, Proceedings. 14th Symposium on Reliable Distributed Systems, 1995.
DOI : 10.1109/RELDIS.1995.526218
, Minimizing latency of agreement protocols, 2005.
, prefix " refers to a non-strict prefix. 1. (Validity) In every commit/abort history, no request appears twice and every request is a valid request, or an element of a valid init history
, The primary r 1 on receiving m = REQ, req, i ?c,? , if: ? req.t c is higher than t 1 [c], then it: ? updates t 1 [c] to req.t c , ? increments sn 1 , and ? sends ORDER, req, i, sn µr 1 ,r j , M AC j to every replica r j , where M AC j is the MAC entry for r j in the client's authenticator for m
, If client c receives 3f + 1 RESP, reply, LHDigest, i, req.t c , * * µ * ,c messages from different replicas before expiration of T , with identical digests of replicas' local history (LHDigest) and identical replies (or digests thereof), then the client commits req with reply, Otherwise, the client triggers the panicking mechanism explained in Section B.5 (Step P1)
, ? from client c, if: ? req.t c is higher than t j [c] then it: ? updates t j [c] to req.t c , ? executes req, and ? sends RESP, reply j , D(LH j ), i, req
, On Invoke i (req), client c sends the message m = CHAIN, req, i to the head (say r 1 ) and triggers the timer T
, The head r 1 , on receiving m = CHAIN, req, i from client c, if: ? req.t c is higher than t 1 [c], and ? the head can verify client's MAC (otherwise the head discards m), then the head: ? updates t 1 [c] to req.t c , ? increments sn 1 , and ? sends CHAIN, req, i, sn 1
, if ? it can verify MACs from all processes from its predecessor set against the content of m, ? sn = sn j + 1, and ? req.t c is higher than t j [c], then it: ? updates sn j to sn and t j [c] to req.t c , ? (ii) executes req, and ? (iii) sends CHAIN, req
, If client c receives CHAIN, req, i, * , reply, LHDigest from the tail before expiration of T , and with MACs from last f + 1 replicas that authenticate req, i, LHDigest and D(reply) (or reply itself), then c commits req with reply. Otherwise, the client triggers the panicking mechanism explained in the following section
, The proof is identical to the proof of ZLight
, Chain guarantees to commit clients' requests under the same conditions as ZLight, i.e., if: there are no replica/link failures and Byzantine client failures Assuming that the message processing at processes takes negligible time, it is sufficient that clients set the timer T, Step C1 to (3f + 2)?. Then, Progress of Chain is very simple to show, along the lines of ZLight Progress (Sec. C.1)