Abstract
This paper presents the first BFT selection model and algorithm that can be used to choose the most convenient protocol according to the BFT user (i.e., an enterprise) preferences. The selection algorithm applies some mathematical formulas to make the selection process easy and automatic. The algorithm operates in three modes: Static, Dynamic, and Heuristic. The Static mode addresses the cases where a single protocol is needed; the Dynamic mode assumes that the system conditions are quite fluctuating and thus requires runtime decisions, and the Heuristic mode uses additional heuristics to improve user choices. To the best of our knowledge, this is the first work that addresses selection in BFT. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Shoker, A., & Bahsoun, J. P. (2013). BFT selection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7853 LNCS, pp. 258–262). https://doi.org/10.1007/978-3-642-40148-0_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
