Probabilistic Byzantine tolerance scheduling in hybrid cloud environments

Luciana Arantes, Roy Friedman, Olivier Marin, Pierre Sens

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProceedings of the 18th International Conference on Distributed Computing and Networking, ICDCN 2017
ISBN (Electronic)9781450348393
DOIs
StatePublished - 5 Jan 2017
Event18th International Conference on Distributed Computing and Networking, ICDCN 2017 - Hyderabad, India
Duration: 5 Jan 20177 Jan 2017

Publication series

NameACM International Conference Proceeding Series

Conference

Conference18th International Conference on Distributed Computing and Networking, ICDCN 2017
Country/TerritoryIndia
CityHyderabad
Period5/01/177/01/17

Keywords

  • Byzantine
  • Hybrid cloud environments
  • Scheduling

All Science Journal Classification (ASJC) codes

  • Software
  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Probabilistic Byzantine tolerance scheduling in hybrid cloud environments'. Together they form a unique fingerprint.

Cite this