Abstract
Threshold (k, n)-schemes are applied to ensure fault tolerance in many protocols of distributed computing, where k is a minimum amount of nodes and \(n \ge k\) is a total number of nodes in the system. When \(n=k\) in such a system, if one of the nodes fails during the execution of this protocol, it is replaced with a new one and the procedure is restarted, while all the time and traffic spent during the previous stages will be lost. If it is initially involved more than the minimum threshold of nodes (\(n > k\)), then in case of any node fails, the protocol will not be restarted. In such a case, an optimization problem arises, which consists in runtime minimizing of the protocol with given constraints on the threshold k and the failure characteristics. In this paper, using the example of the threshold calculation protocol of the digital digest, such an optimization problem will be formulated and solved.
The author Turlikov is supported by research project RFBR No. 17-07-00142.
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
Wang, H., Wang, Y.: Designing fault tolerance strategy by iterative redundancy for component-based distributed computing systems. Math. Probl. Eng. 2014, 11 (2014)
Randles, M., Lamb, D., Odat, E., Taleb-Bendiab, A.: Distributed redundancy and robustness in complex systems. J. Comput. Syst. Sci. 77, 293–304 (2011)
Brun, Y., Edwards, G., Bang, J.Y., Medvidovic, N.: Smart redundancy for distributed computation. In: 31st International Conference on Distributed Computing Systems, pp. 665–676, Minneapolis (2011)
Farley, N., Fitzpatrick, R., Jones, D.: BADGER - Blockchain Auditable Distributed (RSA) key GEneRation. In: IACR Cryptology ePrint Archive (2019)
Di Pietro, R., Mancini, L., Zanin, G.: Efficient and adaptive threshold signatures for ad hoc networks. Electron. Notes Theor. Comput. Sci. 171, 93–105 (2007)
Wang, B., Cai, C., Zhou, Q.: A rational threshold signature model and protocol based on different permissions. J. Appl. Math. 2014, 9 (2014)
Krouk, E., Semenov, S.: Transmission of a message during limited time with the help of transport coding. In: Proceedings of ICETE 2005 – International Conference on E-business and Telecommunication Networks, pp. 88–93, Reading (2005)
Krouk, E., Semenov, S.: Delivery of a message during limited time with the help of transport coding. In: Fifth IEEE Workshop on Signal Processing Advances in Wireless Communications, pp. 1–5. Lisbon (2004)
Kabatiansky, G., Krouk, E., Semenov, S.: Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept. Wiley, New Jersey (2005)
David, H., Nagaraja, H.N.: Order Statistics, 3rd edn. WileyInterscience, New York (2003)
Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambridge University Press, Cambridge (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Afanasyeva, A., Evstafiev, I., Turlikov, A. (2019). Runtime Minimization of the Threshold Distributed Computation Protocol in the Case of Participants Failures. In: Galinina, O., Andreev, S., Balandin, S., Koucheryavy, Y. (eds) Internet of Things, Smart Spaces, and Next Generation Networks and Systems. NEW2AN ruSMART 2019 2019. Lecture Notes in Computer Science(), vol 11660. Springer, Cham. https://doi.org/10.1007/978-3-030-30859-9_25
Download citation
DOI: https://doi.org/10.1007/978-3-030-30859-9_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30858-2
Online ISBN: 978-3-030-30859-9
eBook Packages: Computer ScienceComputer Science (R0)