Maintaining data consistency in distributed computing is essential to maintain system reliability. To this end, many consensus techniques that can maintain data consistency even if a failure occurs are being studied, ...
详细信息
ISBN:
(纸本)9798350330946;9798350330953
Maintaining data consistency in distributed computing is essential to maintain system reliability. To this end, many consensus techniques that can maintain data consistency even if a failure occurs are being studied, and research is being conducted on consensus techniques for Byzantine failures that can occur in unreliable public networks. In this paper, we introduce Byzantine fault tolerance consensus techniques: Practical Byzantine Fault Tolerance, High performance and Scalable Byzantine Fault Tolerance, and Zyzzyva. And we evaluate the performance of them. Afterward, directions for future research are presented.
Almost all real world activities have been digitized and there are various client server architecture based systems in place to handle them. These are all based on trust on third parties. There is an active attempt to...
详细信息
Almost all real world activities have been digitized and there are various client server architecture based systems in place to handle them. These are all based on trust on third parties. There is an active attempt to successfully implement blockchain based systems which ensures that the IT systems are immutable, double spending is avoided and cryptographic strength is provided to them. A successful implementation of blockchain as backbone of existing information technology systems is bound to eliminate various types of fraud and ensure quicker delivery of the item on trade. To adapt IT systems to blockchain architecture, an efficient consensus algorithm need to be designed. Blockchain based on proof of work first came up as the backbone of cryptocurrency. After this, several other methods with variety of interesting features have come up. In this paper, we conduct a survey on existing attempts to achieve consensus in block chain. A federated consensus method and a proof of validation method are being compared.
In any blockchain network, a consensus algorithm is considered a major factor in determining the performance of the network. This study aims to investigate consensus algorithms in healthcare blockchains for electronic...
详细信息
ISBN:
(纸本)9781665420389
In any blockchain network, a consensus algorithm is considered a major factor in determining the performance of the network. This study aims to investigate consensus algorithms in healthcare blockchains for electronic health record (EHR) sharing by analyzing the scalability performance of these algorithms. Several consensus algorithms have been proposed in the literature and have been used for various types of blockchain networks. Herein, we analyze the performance of proof of work, practical Byzantine fault tolerance, and proof of authority (PoA) algorithms in the healthcare domain and propose an improved real-time PoA consensus algorithm for EHR sharing for faster consensus and block generation. Results of performed simulations show that the proposed algorithm outperforms previous consensus algorithms in terms of consensus time, number of blocks generated, network throughput, and scalability.
Differing from existing research on intervention strategies such as leader selection and edge addition, we investigate the impact of intervention timing in opinion dynamics. We employ the leader-based DeGroot model to...
详细信息
Proof-of-authority (PoA) has become a popular consensus algorithm for permissioned blockchains, in which a group of trusted entities governs the networks. This algorithm provides fast consensus while requiring less co...
详细信息
ISBN:
(数字)9781665481465
ISBN:
(纸本)9781665481465
Proof-of-authority (PoA) has become a popular consensus algorithm for permissioned blockchains, in which a group of trusted entities governs the networks. This algorithm provides fast consensus while requiring less computational resources and energy. Aura and Clique are two major implementations of PoA, which have their own set of advantages and disadvantages. In this paper, we evaluate the performance of both algorithms in terms of consistency, availability, partition tolerance, security, block time, and transaction throughput. The algorithms were implemented in Python, and experiments were conducted by connecting six consensus nodes having different computing power. The experimental results were comprehensively analyzed. It was observed that Clique provides higher availability and transaction throughput but lower security and consistency than Aura. The blockchains in the Aura network are immediately consistent while the blockchains stored by individual Clique authorities become eventually consistent. Permissioned blockchain practitioners will find this paper useful in choosing the most appropriate PoA implementation based on their requirements.
This paper considers a consensus optimization problem, where all the nodes in a network, with access to the zeroth-order information of its local objective function only, attempt to cooperatively achieve a common mini...
详细信息
Currently, the integration and coordination of a high quantity of distributed generators (DG) into traditional electrical distribution networks has introduced technical challenges to maintain electrical parameters, su...
详细信息
One of the challenging issues in a distributed computing system is to reach on a decision with the presence of so many faulty nodes. These faulty nodes may update the wrong information, provide misleading results and ...
详细信息
ISBN:
(纸本)9781509029068
One of the challenging issues in a distributed computing system is to reach on a decision with the presence of so many faulty nodes. These faulty nodes may update the wrong information, provide misleading results and may be nodes with the depleted battery power. consensus algorithms help to reach on a decision even with the faulty nodes. Every correct node decides some values by a consensus algorithm. If all correct nodes propose the same value then all the nodes decide on that. Every correct nodes must agree on the same value. Faulty nodes do not reach on the decision that correct nodes agreed on. Binary consensus algorithm and average consensus algorithm are the most widely used consensus algorithm in a distributed system. We apply binary consensus and average consensus algorithm in a distributed sensor network with the presence of some faulty nodes. We evaluate these algorithms for better convergence rate and error rate.
Blockchain is a cutting-edge technology widely recognized for its applications to industry, business, and sustainable development goals. Its key features include tamper-proofing, decentralization, immutability, transp...
详细信息
Blockchain is a cutting-edge technology widely recognized for its applications to industry, business, and sustainable development goals. Its key features include tamper-proofing, decentralization, immutability, transparency, and security. Despite its numerous advantages, Challenges such as privacy and scalability persist. Scalability, is measured with respect to throughput, capacity, and latency, which are remains a crucial aspect of its functionality. The latency includes the timestamp of block inclusion in the blockchain. The proposed methodology suggests using a logistic regression method to enhance the scalability of a blockchain system. The suggested methodology involves analyzing the performance of logistic regression, resulting in higher transactions per second and lower latency time which is measured in milliseconds.
In this paper, we present a novel formulation of the consensus principle for application to the DC analysis of a resistor–capacitor (RC) network driven by multiple sources. The consensus principle is essentially an i...
详细信息
暂无评论