Skip to main content
main-content

Tipp

Weitere Kapitel dieses Buchs durch Wischen aufrufen

2021 | OriginalPaper | Buchkapitel

ASPAS: As Secure as Possible Available Systems

verfasst von : Houssam Yactine, Ali Shoker, Georges Younes

Erschienen in: Distributed Applications and Interoperable Systems

Verlag: Springer International Publishing

share
TEILEN

Abstract

Available-Partition-tolerant (AP) geo-replicated systems trade consistency for availability. They allow replicas to serve clients’ requests without prior synchronization. Potential conflicts due to concurrent operations can then be resolved using a conflict resolution mechanism if operations are commutative and execution is deterministic. However, a Byzantine replica can diverge from deterministic execution of operations and break convergence. In this paper, we introduce ASPAS: As Secure as Possible highly Available System that is a Byzantine resilient AP system. ASPAS follows an optimistic approach to maintain a single round-trip response time. It then allows the detection of Byzantine replicas in the background, i.e., off the critical path of clients requests. Our empirical evaluation of ASPAS in a geo-replicated setting shows that its latency in the normal case is close to that of an AP system, and one order of magnitude better than classical BFT protocols that provide stronger (total ordering) guarantees, unnecessary in AP systems.
Literatur
1.
Zurück zum Zitat Bessani, A., Sousa, J., Alchieri, E.: State machine replication for the masses with BFT-SMART. In: Proceedings of the 44th IEEE/IFIP International Conference on Dependable Systems and Networks. IEEE (2014) Bessani, A., Sousa, J., Alchieri, E.: State machine replication for the masses with BFT-SMART. In: Proceedings of the 44th IEEE/IFIP International Conference on Dependable Systems and Networks. IEEE (2014)
2.
Zurück zum Zitat Baquero, C., Almeida, P.S., Shoker, A.: Making operation-based CRDTs operation-based. In: Distributed Applications and Interoperable Systems - International Conference, DAIS 2014, pp. 126–140 (2014) Baquero, C., Almeida, P.S., Shoker, A.: Making operation-based CRDTs operation-based. In: Distributed Applications and Interoperable Systems - International Conference, DAIS 2014, pp. 126–140 (2014)
5.
Zurück zum Zitat Burckhardt, S., Gotsman, A., Yang, H., Zawirski, M.: Replicated data types: specification, verification, optimality. In: ACM Sigplan Notices, vol. 49, pp. 271–284. ACM (2014) Burckhardt, S., Gotsman, A., Yang, H., Zawirski, M.: Replicated data types: specification, verification, optimality. In: ACM Sigplan Notices, vol. 49, pp. 271–284. ACM (2014)
6.
Zurück zum Zitat Cachin, C.: Architecture of the hyperledger blockchain fabric. In: Workshop on Distributed Cryptocurrencies and Consensus Ledgers, vol. 310 (2016) Cachin, C.: Architecture of the hyperledger blockchain fabric. In: Workshop on Distributed Cryptocurrencies and Consensus Ledgers, vol. 310 (2016)
10.
Zurück zum Zitat Clement, A., et al.: Upright cluster services. In: Proceedings of the ACM SIGOPS 22nd Symposium on Operating Systems Principles, pp. 277–290. ACM (2009) Clement, A., et al.: Upright cluster services. In: Proceedings of the ACM SIGOPS 22nd Symposium on Operating Systems Principles, pp. 277–290. ACM (2009)
11.
Zurück zum Zitat Cooper, B.F., Silberstein, A., Tam, E., Ramakrishnan, R., Sears, R.: Benchmarking cloud serving systems with YCSB. In: Proceedings of the 1st ACM symposium on Cloud computing, pp. 143–154. ACM (2010) Cooper, B.F., Silberstein, A., Tam, E., Ramakrishnan, R., Sears, R.: Benchmarking cloud serving systems with YCSB. In: Proceedings of the 1st ACM symposium on Cloud computing, pp. 143–154. ACM (2010)
12.
Zurück zum Zitat Couto, R.S., Secci, S., Campista, M.E.M., Costa, L.H.M.: Latency versus survivability in geo-distributed data center design. In: 2014 IEEE Global Communications Conference, pp. 1102–1107. IEEE (2014) Couto, R.S., Secci, S., Campista, M.E.M., Costa, L.H.M.: Latency versus survivability in geo-distributed data center design. In: 2014 IEEE Global Communications Conference, pp. 1102–1107. IEEE (2014)
14.
Zurück zum Zitat Gilbert, S., Lynch, N.: Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM SIGACT News 33(2), 51–59 (2002) CrossRef Gilbert, S., Lynch, N.: Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM SIGACT News 33(2), 51–59 (2002) CrossRef
15.
Zurück zum Zitat Guerraoui, R., Kuznetsov, P., Monti, M., Pavlovic, M., Seredinschi, D.A.: Scalable byzantine reliable broadcast (extended version). arXiv preprint arXiv:​1908.​01738 (2019) Guerraoui, R., Kuznetsov, P., Monti, M., Pavlovic, M., Seredinschi, D.A.: Scalable byzantine reliable broadcast (extended version). arXiv preprint arXiv:​1908.​01738 (2019)
16.
Zurück zum Zitat Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: Speculative byzantine fault tolerance. ACM Trans. Comput. Syst. 27(4), 7:1–7:39 (2010) Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: Speculative byzantine fault tolerance. ACM Trans. Comput. Syst. 27(4), 7:1–7:39 (2010)
17.
Zurück zum Zitat Kwon, J.: Tendermint: Consensus without mining. Draft v. 0.6, fall 1(11) (2014) Kwon, J.: Tendermint: Consensus without mining. Draft v. 0.6, fall 1(11) (2014)
18.
Zurück zum Zitat Lamport, L.: Time, clocks, and the ordering of events in a distributed system, pp. 558–565. ACM (1978) Lamport, L.: Time, clocks, and the ordering of events in a distributed system, pp. 558–565. ACM (1978)
19.
Zurück zum Zitat Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978) CrossRef Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978) CrossRef
21.
Zurück zum Zitat Malkhi, D., Merritt, M., Rodeh, O.: Secure reliable multicast protocols in a WAN. Distrib. Comput. 13(1), 19–28 (2000) CrossRef Malkhi, D., Merritt, M., Rodeh, O.: Secure reliable multicast protocols in a WAN. Distrib. Comput. 13(1), 19–28 (2000) CrossRef
22.
Zurück zum Zitat Saito, Y., Shapiro, M.: Optimistic replication. ACM Comput. Surv. (CSUR) 37(1), 42–81 (2005) CrossRef Saito, Y., Shapiro, M.: Optimistic replication. ACM Comput. Surv. (CSUR) 37(1), 42–81 (2005) CrossRef
23.
Zurück zum Zitat Schneider, F.B.: Replication management using the state-machine approach, distributed systems (1993) Schneider, F.B.: Replication management using the state-machine approach, distributed systems (1993)
24.
Zurück zum Zitat Shapiro, M., Preguiça, N., Baquero, C., Zawirski, M.: A comprehensive study of convergent and commutative replicated data types (2011) Shapiro, M., Preguiça, N., Baquero, C., Zawirski, M.: A comprehensive study of convergent and commutative replicated data types (2011)
27.
Zurück zum Zitat Vogels, W.: Eventually consistent: building reliable distributed systems at a worldwide scale demands trade-offs? Between consistency and availability. Queue 6(6), 14–19 (2008) CrossRef Vogels, W.: Eventually consistent: building reliable distributed systems at a worldwide scale demands trade-offs? Between consistency and availability. Queue 6(6), 14–19 (2008) CrossRef
28.
Zurück zum Zitat White, B., et al.: An integrated experimental environment for distributed systems and networks. ACM SIGOPS Oper. Syst. Rev. 36(SI), 255–270 (2002) White, B., et al.: An integrated experimental environment for distributed systems and networks. ACM SIGOPS Oper. Syst. Rev. 36(SI), 255–270 (2002)
29.
Zurück zum Zitat Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: Hotstuff: BFT consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 347–356 (2019) Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: Hotstuff: BFT consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 347–356 (2019)
Metadaten
Titel
ASPAS: As Secure as Possible Available Systems
verfasst von
Houssam Yactine
Ali Shoker
Georges Younes
Copyright-Jahr
2021
DOI
https://doi.org/10.1007/978-3-030-78198-9_4

Premium Partner