Results 21 to 30 of about 1,316 (199)
Hardening Cassandra Against Byzantine Failures
CoRR, 2016 Cassandra is one of the most widely used distributed data stores these days. Cassandra supports flexible consistency guarantees over a wide-column data access model and provides almost linear scale-out performance. This enables application developers to tailor the performance and availability of Cassandra to their exact application's needs and required
Friedman, Roy, Licher, Roni
openaire +4 more sources
Blockchain Based Cloud Management Architecture for Maximum Availability.
International Journal of Interactive Multimedia and Artificial Intelligence, 2023 Contemporary cloud application and Edge computing orchestration systems rely on controller/worker design patterns to allocate, distribute, and manage resources.
Alberto Arias Maestro +3 more
doaj +1 more source
Hardening Cassandra Against Byzantine Failures [PDF]
, 2018 Cassandra is one of the most widely used distributed data stores. In this work, we analyze Cassandra’s vulnerabilities when facing Byzantine failures and propose protocols for hardening Cassandra against them.
Licher, Roni, Friedman, Roy
core +1 more source
IEEE Access, 2021 This paper presents the first, novel, dynamic, resilient, and consistent Blockchain COngestion ContrOL (BCOOL) system for vehicular networks that fills the gap of trustworthy Blockchain congestion prediction systems.
Saida Maaroufi, Samuel Pierre
doaj +1 more source
Clock Synchronization in the Byzantine-Recovery Failure Model [PDF]
, 2008 We consider the problem of synchronizing clocks in synchronous systems prone to transient and dynamic process failures, i.e., we consider systems where all processes may alternate correct and Byzantine behaviors. We propose a clock synchronization algorithm based on periodical resynchronizations which is based on the assumption that no more than f < n ...
Anceaume, Emmanuelle +4 more
openaire +2 more sources
International Journal of Distributed Sensor Networks, 2012 Network coding (NC) can be applied to achieve the maximal information flow in a network. In energy-constraint wireless networks such as wireless sensor networks, applying NC can further reduce the number of wireless transmissions and hence prolong the ...
Jen-Yeu Chen, Yi-Ying Tseng
doaj +1 more source
Quorums Systems as a Method to Enhance Collaboration for Achieving Fault Tolerance in Distributed System [PDF]
Informatică economică, 2009 A system that implements the byzantine agreement algorithm is supposed to be very reliable and robust because of its fault tolerating feature. For very realistic environments, byzantine agreement protocols becomes inadequate, because they are based on ...
Ioan PETRI
doaj
Error-free multi-valued consensus with byzantine failures [PDF]
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, 2011 In this paper, we present an efficient deterministic algorithm for consensus in presence of Byzantine failures. Our algorithm achieves consensus on an $L$-bit value with communication complexity $O(nL + n^4 L^{0.5} + n^6)$ bits, in a network consisting of $n$ processors with up to $t$ Byzantine failures, such that ...
Guanfeng Liang, Nitin H. Vaidya
openaire +3 more sources
Authenticated Byzantine Generals in Dual Failure Model [PDF]
, 2010 Pease et al. introduced the problem of Byzantine Generals (BGP) to study the effects of Byzantine faults in distributed protocols for reliable broadcast. It is well known that BGP among n players tolerating up to t faults is (efficiently) possible iff n > 3t. To overcome this severe limitation, Pease et al.
Anuj Gupta 0001 +3 more
openaire +2 more sources
Optimal Eventual Byzantine Agreement Protocols with Omission Failures
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023 Work on \emph{optimal} protocols for \emph{Eventual Byzantine Agreement} (EBA) -- protocols that, in a precise sense, decide as soon as possible in every run and guarantee that all nonfaulty agents decide on the same value -- has focused on emph{full-information protocols} (FIPs), where agents repeatedly send messages that completely describe their ...
Kaya Alpturer +2 more
openaire +2 more sources