Probabilistic Byzantine Tolerance Scheduling in Hybrid Cloud Environments
Open Access
- 5 January 2017
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Abstract
This work explores scheduling challenges in providing probabilistic Byzantine fault tolerance in a hybrid cloud environment, consisting of nodes with varying reliability levels, compute power, and monetary cost. In this context, the probabilistic Byzantine fault tolerance guarantee refers to the confidence level that the result of a given computation is correct despite potential Byzantine failures. We formally define a family of such scheduling problems distinguished by whether they insist on meeting a given latency limit and trying to optimize the monetary budget or vice versa. For the case where the latency bound is a restriction and the budget should be optimized, we present several heuristic protocols and compare between them using extensive simulations.Keywords
This publication has 32 references indexed in Scilit:
- Failure-aware resource provisioning for hybrid Cloud infrastructureJournal of Parallel and Distributed Computing, 2012
- Fast asynchronous Byzantine agreement and leader election with full informationACM Transactions on Algorithms, 2010
- Lower Bounds for Randomized Consensus under a Weak AdversarySIAM Journal on Computing, 2010
- A survey of attack and defense techniques for reputation systemsACM Computing Surveys, 2009
- Tight bounds for asynchronous randomized consensusJournal of the ACM, 2008
- Practical byzantine fault tolerance and proactive recoveryACM Transactions on Computer Systems, 2002
- An adaptive approach to achieving hardware and software fault tolerance in a distributed computing environmentJournal of Systems Architecture, 2002
- Sabotage-tolerance mechanisms for volunteer computing systemsFuture Generation Computer Systems, 2002
- Reputation systemsCommunications of the ACM, 2000
- Consensus in the presence of partial synchronyJournal of the ACM, 1988