Results 31 to 40 of about 1,031,501 (207)
On the Practicality of Practical Byzantine Fault Tolerance [PDF]
, 2012 Byzantine Fault Tolerant (BFT) systems are considered by the systems research community to be state of the art with regards to providing reliability in distributed systems. BFT systems provide safety and liveness guarantees with reasonable assumptions, amongst a set of nodes where at most f nodes display arbitrarily incorrect behaviors, known as ...
Nikos Chondros +2 more
openaire +5 more sources
An improved PBFT consensus algorithm based on grouping and credit grading
Scientific Reports, 2023 To improve the blockchain consensus algorithm practical Byzantine fault tolerance (PBFT) with random master node selection, which has high communication overhead and a small supported network size, this paper proposes a Byzantine fault tolerant consensus
Shannan Liu +4 more
doaj +1 more source
Big Data and Cognitive Computing, 2023 A Practical Byzantine Fault Tolerance (PBFT) is a consensus algorithm deployed in a consortium blockchain that connects a group of related participants.
Widya Nita Suliyanti, Riri Fitri Sari
doaj +1 more source
Improved Fault-Tolerant Consensus Based on the PBFT Algorithm
IEEE Access, 2022 Nowadays Practical Byzantine Fault Tolerance (PBFT) algorithm has become the most extensive consensus algorithm in the alliance chain. However, the PBFT algorithm is usually only applicable to small networks due to high communication complexity and poor ...
Jian Yang +4 more
doaj +1 more source
Automating fault tolerance in high-performance computational biological jobs using multi-agent approaches [PDF]
, 2014 Background: Large-scale biological jobs on high-performance computing systems require manual intervention if one or more computing cores on which they execute fail.
Varghese, Blesson +2 more
core +1 more source
Efficient Quantum-secure Byzantine Fault Tolerance Consensus Mechanism Based on HotStuff [PDF]
Jisuanji kexueThe public-key digital signature used by Byzantine fault tolerance consensus mechanism in the classic blockchain exposes vulnerability to quantum computers that have the exponential acceleration of computing power,and therefore have security risks.To ...
CHENG Andong, XIE Sijiang, LIU Ang, FENG Yimeng
doaj +1 more source
Entangled state testing in the quantum Byzantine agreement
网络与信息安全学报, 2016 In distributed computing,Byzantine agreement is a practical method to solve its fault-tolerance problem.There is a variation of the Byzantine agreement which is called detectable Byzantine agreement.This kind of protocol is unsolvable by classical means ...
Xia WU,Heng-yue JIA,Jian-ming ZHU
doaj +3 more sources
Towards Immune Inspired Fault Tolerance in Embedded Systems [PDF]
, 2002 The immune system is a remarkable natural system that is proving to be of great inspiration to computer scientists and engineers alike. This paper discusses the role that the immune system can play in the development of fault tolerant embedded systems ...
Timmis, Jon +3 more
core +1 more source
A Blockchain-Enabled Distributed Advanced Metering Infrastructure Secure Communication (BC-AMI)
Applied Sciences, 2022 The world is facing an urgent need to provide secure communication and data access control in advanced metering infrastructure (AMI) because conventional cryptographic key management and authentication protocols are at stake.
Nahida Islam +4 more
doaj +1 more source
High throughput Byzantine fault tolerance [PDF]
International Conference on Dependable Systems and Networks, 2004, 2004 This paper argues for a simple change to Byzantine fault tolerant (BFT) state machine replication libraries. Traditional BFT state machine replication techniques provide high availability and security but fail to provide high throughput. This limitation stems from the fundamental assumption of generalized state machine replication techniques that all ...
Ramakrishna Kotla, Michael Dahlin
openaire +2 more sources