Results 21 to 30 of about 556 (156)
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
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
Highly dynamic distributed computing with byzantine failures
Proceedings of the 2013 ACM symposium on Principles of distributed computing, 2013 This paper shows for the first time that distributed computing can be both reliable and efficient in an environment that is both highly dynamic and hostile. More specifically, we show how to maintain clusters of size O(log N), each containing more than two thirds of honest nodes with high probability, within a system whose size can vary polynomially ...
Guerraoui, R. +2 more
openaire +2 more sources
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
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
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
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
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
“Ega ma arsti juurde ju ometi ei lähe!” Eemiline uskmatus oletataval uue vaimsuse uurimisväljal [PDF]
Mäetagused, 2019 The paper “I wouldn't go to the doctor anyway!” presents a study of alternative medicine practices among Estonians, who are allegedly the least religious people in the world. Only 6 percent of Estonians consider religion important in their lives and only
Age Kristel Kartau
doaj +1 more source
Iterative Approximate Consensus in the Presence of Byzantine Link Failures [PDF]
, 2014 This paper explores the problem of reaching approximate consensus in synchronous point-to-point networks, where each directed link of the underlying communication graph represents a communication channel between a pair of nodes. We adopt the transient Byzantine link failure model [15, 16], where an omniscient adversary controls a subset of the directed
Lewis Tseng, Nitin H. Vaidya
openaire +2 more sources