Abstract
Causal ordering in an asynchronous setting is a fundamental paradigm for collaborative software systems. Previous work in the area concentrates on ordering messages in a faultless setting and on ordering broadcasts under various fault models. To the best of our knowledge, Byzantine fault-tolerant causal ordering has not been studied for unicasts and multicasts in an asynchronous setting. In this paper we first show that protocols presented in previous work fail for unicasts and multicasts under Byzantine faults in an asynchronous setting. Then we analyze, propose, and prove results on the solvability of the related problems of causal unicasts, multicasts, and broadcasts in an asynchronous system with one or more Byzantine failures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Auvolat, A., Frey, D., Raynal, M., Taïani, F.: Byzantine-tolerant causal broadcast. Theoret. Comput. Sci. 885, 55–68 (2021)
Birman, K.P., Joseph, T.A.: Reliable communication in the presence of failures. ACM Trans. Comput. Syst. (TOCS) 5(1), 47–76 (1987)
Bracha, G.: Asynchronous byzantine agreement protocols. Inf. Comput. 75(2), 130–143 (1987). https://doi.org/10.1016/0890-5401(87)90054-X
Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM 32(4), 824–840 (1985). https://doi.org/10.1145/4221.214134
Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Seltzer, M.I., Leach, P.J. (eds.) Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), pp. 173–186 (1999)
Chandra, P., Gambhire, P., Kshemkalyani, A.D.: Performance of the optimal causal multicast algorithm: a statistical analysis. IEEE Trans. Parallel Distrib. Syst. 15(1), 40–52 (2004). https://doi.org/10.1109/TPDS.2004.1264784
Chandra, P., Kshemkalyani, A.D.: Causal multicast in mobile networks. In: 12th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), pp. 213–220 (2004). https://doi.org/10.1109/MASCOT.2004.1348235
Collins, D., et al.: Online payments by merely broadcasting messages. In: 50th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2020, pp. 26–38 (2020)
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (1995). https://doi.org/10.7551/mitpress/5803.001.0001
Hadzilacos, V., Toueg, S.: A modular approach to fault-tolerant broadcasts and related problems. Technical report, 94-1425, Cornell University, p. 83 pages (1994)
Huang, K., Wei, H., Huang, Y., Li, H., Pan, A.: Byz-GentleRain: an efficient byzantine-tolerant causal consistency protocol. ar**v preprint ar**v:2109.14189 (2021)
Kleppmann, M., Howard, H.: Byzantine eventual consistency and the fundamental limits of peer-to-peer databases. ar**v preprint ar**v:2012.00472 (2020)
Kshemkalyani, A.D., Singhal, M.: An optimal algorithm for generalized causal message ordering (abstract). In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, p. 87. ACM (1996). https://doi.org/10.1145/248052.248064
Kshemkalyani, A.D., Singhal, M.: Necessary and sufficient conditions on information for causal message ordering and their optimal implementation. Distrib. Comput. 11(2), 91–111 (1998). https://doi.org/10.1007/s004460050044
Kshemkalyani, A.D., Singhal, M.: Distributed Computing: Principles, Algorithms, and Systems. Cambridge University Press, Cambridge (2011). https://doi.org/10.1017/CBO9780511805318
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)
Liskov, B., Ladin, R.: Highly available distributed services and fault-tolerant distributed garbage collection. In: Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, pp. 29–39 (1986)
Malkhi, D., Merritt, M., Rodeh, O.: Secure reliable multicast protocols in a WAN. In: Proceedings of the 17th International Conference on Distributed Computing Systems, pp. 87–94 (1997). https://doi.org/10.1109/ICDCS.1997.597857
Malkhi, D., Reiter, M.K.: A high-throughput secure reliable multicast protocol. J. Comput. Secur. 5(2), 113–128 (1997). https://doi.org/10.3233/JCS-1997-5203
Misra, A., Kshemkalyani, A.D.: Byzantine fault tolerant causal ordering. CoRR abs/2112.11337 (2021). https://arxiv.org/abs/2112.11337
Mostefaoui, A., Perrin, M., Raynal, M., Cao, J.: Crash-tolerant causal broadcast in o (n) messages. Inf. Process. Lett. 151, 105837 (2019)
Prakash, R., Raynal, M., Singhal, M.: An adaptive causal ordering algorithm suited to mobile computing environments. J. Parallel Distrib. Comput. 41(2), 190–204 (1997)
Raynal, M., Schiper, A., Toueg, S.: The causal ordering abstraction and a simple way to implement it. Inf. Process. Lett. 39(6), 343–350 (1991)
Schiper, A., Eggli, J., Sandoz, A.: A new algorithm to implement causal ordering. In: Bermond, J.-C., Raynal, M. (eds.) WDAG 1989. LNCS, vol. 392, pp. 219–232. Springer, Heidelberg (1989). https://doi.org/10.1007/3-540-51687-5_45
Tseng, L., Wang, Z., Zhao, Y., Pan, H.: Distributed causal memory in the presence of byzantine servers. In: 2019 IEEE 18th International Symposium on Network Computing and Applications (NCA), pp. 1–8 (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Misra, A., Kshemkalyani, A.D. (2022). Solvability of Byzantine Fault-Tolerant Causal Ordering Problems. In: Koulali, MA., Mezini, M. (eds) Networked Systems. NETYS 2022. Lecture Notes in Computer Science, vol 13464. Springer, Cham. https://doi.org/10.1007/978-3-031-17436-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-031-17436-0_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-17435-3
Online ISBN: 978-3-031-17436-0
eBook Packages: Computer ScienceComputer Science (R0)