Abstract
We study a well-known communication abstraction called Byzantine Reliable Broadcast (BRB). This abstraction is central in the design and implementation of fault-tolerant distributed systems, as many fault-tolerant distributed applications require communication with provable guarantees on message deliveries. Our study focuses on fault-tolerant implementations for message-passing systems that are prone to process-failures, such as crashes and malicious behaviors.
At PODC 1983, Bracha and Toueg, in short, BT, solved the BRB problem. BT has optimal resilience since it can deal with up to \(t < n/3\) Byzantine processes, where n is the number of processes. The present work aims at the design of an even more robust solution than BT by expanding its fault-model with self-stabilization, a vigorous notion of fault-tolerance. In addition to tolerating Byzantine and communication failures, self-stabilizing systems can recover after the occurrence of arbitrary transient-faults. These faults represent any violation of the assumptions according to which the system was designed to operate (as long as the algorithm code remains intact).
We propose, to the best of our knowledge, the first self-stabilizing Byzantine fault-tolerant (SSBFT) solution for repeated BRB (that follows BT’s specifications) in signature-free message-passing systems. Our contribution includes a self-stabilizing variation on a BT that solves asynchronous single-instance BRB. We also consider the problem of recycling instances of single-instance BRB. Our SSBFT recycling for time-free systems facilitates the concurrent handling of a predefined number of BRB invocations and, by this way, can serve as the basis for SSBFT consensus.
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
References
Raynal, M.: Fault-tolerant message-passing distributed systems - an algorithmic approach. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94141-7
Auvolat, A., Raynal, M., Taïani, F.: Byzantine-tolerant set-constrained delivery broadcast. In: OPODIS 2019-International Conference on Principles of Distributed Systems, pp. 1–23. ACM (2019)
Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM 32(4), 824–840 (1985). Also appeared at ACM PODC. 1983, 12–26 (1985)
Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27, 228–234 (1980)
Doudou, A., Garbinato, B., Guerraoui, R., Schiper, A.: Muteness failure detectors: specification and implementation. In: Hlavička, J., Maehle, E., Pataricza, A. (eds.) EDCC 1999. LNCS, vol. 1667, pp. 71–87. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48254-7_7
Altisen, K., Devismes, S., Dubois, S., Petit, F.: Introduction to distributed self-stabilizing algorithms. Synth. Lect. Distrib. Comput. Theory 8(1), 1–165 (2019)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17, 643–644 (1974)
Duvignau, R., Raynal, M., Schiller, E.M.: Self-stabilizing Byzantine-tolerant broadcast. arXiv preprint arXiv:2201.12880 (2022)
Bonomi, S., Decouchant, J., Farina, G., Rahli, V., Tixeuil, S.: Practical Byzantine reliable broadcast on partially connected networks. In: 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), pp. 506–516. IEEE (2021)
Guerraoui, R., Komatovic, J., Kuznetsov, P., Pignolet, Y., Seredinschi, D., Tonkikh, A.: Dynamic Byzantine reliable broadcast. In: OPODIS, vol. 184, pp. 23:1–23:18. LIPIcs, Schloss Dagstuhl (2020)
Albouy, T., Frey, D., Raynal, M., Taïani, F.: Byzantine-tolerant reliable broadcast in the presence of silent churn. In: Johnen, C., Schiller, E.M., Schmid, S. (eds.) SSS 2021. LNCS, vol. 13046, pp. 21–33. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-91081-5_2
Lundström, O., Raynal, M., M. Schiller, E.: Self-stabilizing uniform reliable broadcast. In: Georgiou, C., Majumdar, R. (eds.) NETYS 2020. LNCS, vol. 12129, pp. 296–313. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-67087-0_19
Mostéfaoui, A., Raynal, M.: Intrusion-tolerant broadcast and agreement abstractions in the presence of Byzantine processes. IEEE Trans. Parall. Distrib. Syst. 27, 1085–1098 (2016)
Toueg, S.: Randomized Byzantine agreements. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, pp. 163–178 (1984)
Maurer, A., Tixeuil, S.: Self-stabilizing Byzantine broadcast. In: 2014 IEEE 33rd International Symposium on Reliable Distributed Systems, pp. 152–160. IEEE (2014)
Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32, 374–382 (1985)
Duvignau, R., Raynal, M., Schiller, E.M.: Self-stabilizing Byzantine- and intrusion-tolerant consensus. arXiv preprint arXiv:2110.08592 (2021)
Georgiou, C., Marcoullis, I., Raynal, M., Schiller, E.M.: Loosely-self-stabilizing Byzantine-tolerant binary consensus for signature-free message-passing systems. In: Echihabi, K., Meyer, R. (eds.) NETYS 2021. LNCS, vol. 12754, pp. 36–53. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-91014-3_3
Dolev, S., Hanemann, A., Schiller, E.M., Sharma, S.: Self-stabilizing end-to-end communication in (bounded capacity, omitting, duplicating and non-FIFO) dynamic networks. In: Richa, A.W., Scheideler, C. (eds.) SSS 2012. LNCS, vol. 7596, pp. 133–147. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33536-5_14
Beauquier, J., Kekkonen-Moneta, S.: Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors. Int. J. Syst. Sci. 28, 1177–1187 (1997)
Blanchard, P., Dolev, S., Beauquier, J., Delaët, S.: Practically self-stabilizing Paxos replicated state-machine. In: Noubir, G., Raynal, M. (eds.) NETYS 2014. LNCS, vol. 8593, pp. 99–121. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-09581-3_8
Lundström, O., Raynal, M., Schiller, E.M.: Self-stabilizing indulgent zero-degrading binary consensus. In: International Conference on Distributed Computing and Networking 2021, pp. 106–115 (2021)
Lundström, O., Raynal, M., Schiller, E.M.: Self-stabilizing multivalued consensus in asynchronous crash-prone systems. In: 2021 17th European Dependable Computing Conference (EDCC), pp. 111–118. IEEE (2021)
Lundström, O., Raynal, M., Schiller, E.M.: Self-stabilizing total-order broadcast. arXiv preprint arXiv:2209.14685 (2022)
Acknowledgments
The work of E. M. Schiller was partly supported by the CyReV project (2019-03071) funded by VINNOVA, the Swedish Governmental Agency for Innovation Systems.
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
Duvignau, R., Raynal, M., Schiller, E.M. (2022). Self-stabilizing Byzantine Fault-Tolerant Repeated Reliable Broadcast. In: Devismes, S., Petit, F., Altisen, K., Di Luna, G.A., Fernandez Anta, A. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2022. Lecture Notes in Computer Science, vol 13751. Springer, Cham. https://doi.org/10.1007/978-3-031-21017-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-031-21017-4_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-21016-7
Online ISBN: 978-3-031-21017-4
eBook Packages: Computer ScienceComputer Science (R0)