• DocumentCode
    127556
  • Title

    Byzantine Fault Tolerance for Services with Commutative Operations

  • Author

    Hua Chai ; Wenbing Zhao

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Cleveland State Univ., Cleveland, OH, USA
  • fYear
    2014
  • fDate
    June 27 2014-July 2 2014
  • Firstpage
    219
  • Lastpage
    226
  • Abstract
    In this paper, we present a comprehensive study on how to achieve Byzantine fault tolerance for services with commutative operations. Recent research suggests that services may be implemented using Conflict-free Replicated Data Types (CRDTs) for highly efficient optimistic replication with the crash-fault model. We extend such studies by adopting the Byzantine fault model, which encompasses crash faults as well as malicious faults. We carefully analyze the threats towards the operations in a system constructed with CRDTs, and propose a lightweight solution to achieve Byzantine fault tolerance with low runtime overhead. We define a set of correctness properties for such systems and prove that the proposed Byzantine fault tolerance mechanisms guarantee these properties. Furthermore, we show that our mechanisms exhibit excellent performance with a proof-of-concept replicated shopping cart service constructed using CRDTs.
  • Keywords
    Web services; computer crime; replicated databases; software fault tolerance; Byzantine fault model; Byzantine fault tolerance; CRDT; commutative operations; conflict-free replicated data types; correctness properties; crash-fault model; malicious faults; optimistic replication; runtime overhead; threats; Computer crashes; Fault tolerance; Fault tolerant systems; History; Mechanical factors; Servers; Synchronization; Asynchronous Communication; Byzantine Fault Tolerance; CAP Theorem; Network Partitioning; Optimistic Replication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Services Computing (SCC), 2014 IEEE International Conference on
  • Conference_Location
    Anchorage, AK
  • Print_ISBN
    978-1-4799-5065-2
  • Type

    conf

  • DOI
    10.1109/SCC.2014.37
  • Filename
    6930537