Abstract
A Boolean value of given a priori probability distribution is transmitted to a deciding agent by several processes. Each process fails independently with given probability, and faulty processes behave in a Byzantine way. A deciding agent has to make a decision concerning the transmitted value on the basis of messages obtained by processes. We construct a deterministic decision strategy which has the provably highest probability of correctness. It computes the decision in time linear in the number of processes.
Decision optimality may be alternatively approached from a local, rather than global, point of view. Instead of maximizing the total probability of correctness of a decision strategy, we may try to find, for every set of values conveyed by processes, the conditionally most probable original value that could yield this set. We call such a strategy locally optimal, as it locally optimizes the probability of a decision, given a set of relayed values, disregarding the impact of such a choice on the overall probability of correctness. We construct a locally optimal decision strategy which again computes the decision value in time linear in the number of processes. We establish the surprising fact that, in general, local probability maximization may lead to a decision strategy which does not have the highest probability of correctness. However, if the probability distribution of the Boolean value to be conveyed is uniform, and all processes have the same failure probability smaller than 1/2, this anomaly does not occur.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barbara, D., Garcia-Molina, H.: The Vulnerability of Vote Assignments. ACM Transactions on Computer Systems 4, 187–213 (1986)
Barbara, D., Garcia-Molina, H.: The Reliability of Voting Mechanisms. IEEE Transactions on Computers 36, 1197–1208 (1987)
Blough, D., Sullivan, G.: A comparison of voting strategies for fault-tolerant distributed systems. In: Proc. 9th Symp. on Reliable Distr. Systems, pp. 136–145 (1990)
Blough, D., Sullivan, G.: Voting using predispositions. IEEE Trans. on Reliability 43, 604–616 (1994)
Diks, K., Pelc, A.: Globally optimal diagnosis in systems with random faults. IEEE Transactions on Computers 46, 200–204 (1997)
Diks, K., Kranakis, E., Krizanc, D., Mans, B., Pelc, A.: Optimal coteries and voting schemes. Information Processing Letters 51, 1–6 (1994)
Garcia-Molina, H., Barbara, D.: How to assign Votes in a distributed system. Journal of the ACM 32, 841–860 (1985)
Kakugawa, H., Fujita, S., Yamashita, M., Ae, T.: Availability of k-Coterie. IEEE Transactions on Computers 42, 553–558 (1993)
Pelc, A.: Optimal diagnosis of heterogeneous systems with random faults. IEEE Transactions on Computers 47, 298–304 (1998)
Preparata, F., Metze, G., Chien, R.: On the connection assignment problem of diagnosable systems. IEEE Trans. on Electron. Computers 16, 848–854 (1967)
Spasojevic, M., Berman, P.: Voting as the optimal static pessimistic scheme for managing replicated data. IEEE Transactions on Parallel and Distributed Systems 5, 64–73 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paquette, M., Pelc, A. (2004). Optimal Decision Strategies in Byzantine Environments. In: Královic̆, R., Sýkora, O. (eds) Structural Information and Communication Complexity. SIROCCO 2004. Lecture Notes in Computer Science, vol 3104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27796-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-27796-5_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22230-9
Online ISBN: 978-3-540-27796-5
eBook Packages: Springer Book Archive