检索结果-内蒙古大学图书馆

International Conference on Communications, Information System and Computer Engineering (CISCE)

作者： Pu Wang School of Computer and Artificial Intelligence Zhengzhou University Zhengzhou China

ISBN: (数字)9798350353174

ISBN: (纸本)9798350353181

Aiming at the Byzantine fault-tolerant consensus algorithm when the number of nodes is too large, there are problems such as a large amount of data exchange, slow consensus speed, and security degradation caused by proxy nodes, based on threshold signatures, a new Byzantine fault-tolerant consensus algorithm based on local temporary consensus and global confirmation is proposed. Nodes divide into different zones based on their geographical location, the algorithm conducts temporary consensus among zones in parallel, and all nodes participate in global confirmation together, reducing the amount of network data exchange during the consensus process while improving consensus speed and security.

关键词： Degradation Fault tolerance Fault tolerant systems consensus algorithm Computer security Information systems

来源：评论

学校读者我要写书评

暂无评论

D-PoA: A consensus algorithm for Medical Data SharingBased on Dynamic Scoring

D-PoA: A Consensus Algorithm for Medical Data SharingBased o...

引用

IEEE International Conference on Web Services (ICWS)

作者： Gang Wang GuoWu Li Zheng Ma Xi'an University of Finance and Economics Xi'an

ISBN: (数字)9798350368550

ISBN: (纸本)9798350368567

As an effective tool to ensure data security, blockchain has attracted extensive attention in medical data sharing. The core of blockchain is consensus algorithm, among them, proof of authority (PoA) is a consensus algorithm widely used in Permissioned chain, which has the characteristics of high efficiency and strong scalability. However, it also has some problems such as unknown credibility of authoritative nodes and poor enthusiasm of nodes. So this paper proposed an improved dynamic scoring-based PoA algorithm (D-PoA). Firstly, the dynamic scoring mechanism is introduced to screen the authoritative nodes, so as to improve the credibility and enthusiasm of the authoritative nodes; Then the consistency process is optimized to improve the work efficiency of the system. Experiments show that D-PoA algorithm has some advantages over PoA algorithm in consensus reliability, transaction delay and throughput.

关键词： Web services Heuristic algorithms Scalability Data security consensus algorithm Throughput Delays Blockchains Reliability

来源：评论

学校读者我要写书评

暂无评论

Hybrid Incremental Cost consensus algorithm for Smart Grid Distributed Energy Management under Packet Loss Environment

Hybrid Incremental Cost Consensus Algorithm for Smart Grid D...

引用

Annual Conference of the IEEE Industrial Electronics Society

作者： Yuan Zhang Mo-Yuen Chow Department of Electrical and Computer Engineering North Carolina State University

ISBN: (纸本)9781479940318

With the development of smart grid technology, the future power system will become a complex cyber-physical system. The control and management of this system will impose new challenges to the current Supervisory Control and Data Acquisition system such as scalability in its computational and communications effort, and robustness to single point of failure. Decentralized cooperative control is promising to control and manage such a system in a more efficient and robust way. consensus based algorithms have been proposed by researchers to deal with various power system applications in a distributed manner. Because of the sensitivity to communications imperfections, the performance of the consensus based algorithms degrade when the communication packet loss happens in practical applications. In this paper, a Hybrid Incremental Cost consensus (Hybrid ICC) algorithm is proposed. Different from other consensus based algorithms, the Hybrid ICC algorithm is robust against communications imperfections by integrating gossip algorithm and consensus algorithm together. Several case studies are presented to illustrate the performance of the proposed Hybrid ICC algorithm and demonstrate the scalability and robustness under packet loss scenarios.

关键词： consensus algorithm Distributed control Economic dispatch Energy management Gossip algorithm Packet loss Smart grid

来源：评论

学校读者我要写书评

暂无评论

Optimization of PBFT consensus algorithm in Piecewise Blockchain

Optimization of PBFT Consensus Algorithm in Piecewise Blockc...

引用

Big Data, Artificial Intelligence and Risk Management (ICBAR), International Conference on

作者： Guannan Sun Kaiqi Xu Jiayi Wu Xinjie Wang Zuxin Liu Qufu Normal University China

The consensus mechanism, as the foundation and core of blockchain technology, fundamentally determines the security, availability, etc. of the whole blockchain system. In this paper, an improved algorithm of PBFT based on network partitioning is proposed. Firstly, the nodes are divided into network slices, and the Raft mechanism is used for consensus within each slice, while each slice elects leaders to form a committee, and the PBFT mechanism is used for consensus within the committee. Supervisory nodes and sorting nodes are also introduced to improve the security of the algorithm.

关键词： consensus algorithm Big Data Partitioning algorithms consensus protocol Security Risk management Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Research on application analysis of production-education integration path based on consensus algorithm 22

Research on application analysis of production-education int...

引用

Proceedings of the 2022 5th International Conference on E-Business, Information Management and Computer Science

作者： Fashuang Huang Yuan Fu Wuhan Business University China

ISBN: (纸本)9781450397827

Consistency means that in a multi-structure agent network, each agent interacts and interacts with certain information according to certain control rules, and finally all agents in the network reach agreement on certain key information or states. In this paper, by analyzing the information network and weight of each subject unit under the mode of integration of industry and education, and researching and analyzing common distributed structures and mathematical models, on this basis, a path of industry-university integration based on consensus algorithm is established, and given The corresponding evaluation indicators are given, and a new way of thinking is provided for the research of relevant personnel.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

On Linear Convergence of PI consensus algorithm under the Restricted Secant Inequality

On Linear Convergence of PI Consensus Algorithm under the Re...

引用

Indian Control Conference (ICC)

作者： Kushal Chakrabarti Mayank Baranwal Division of Data & Decision Sciences Tata Consultancy Services Research Mumbai India Faculty of Systems & Control Engineering Indian Institute of Technology Bombay

ISBN: (数字)9798331517212

ISBN: (纸本)9798331517229

This paper considers solving distributed optimization problems in peer-to-peer multi-agent networks. The network is synchronous and connected. By using the proportional-integral (PI) control strategy, various algorithms with fixed stepsize have been developed. Two notable among them are the PI algorithm and the PI consensus algorithm. Although the PI algorithm has provable linear or exponential convergence without the standard requirement of (strong) convexity, a similar guarantee for the PI consensus algorithm is unavailable. In this paper, using Lyapunov theory, we guarantee exponential convergence of the PI consensus algorithm for global cost functions that satisfy the restricted secant inequality, with rate-matching discretization, without requiring convexity. To accelerate the PI consensus algorithm, we incorporate local pre-conditioning in the form of constant positive definite matrices and numerically validate its efficiency compared to the prominent distributed convex optimization algorithms. Unlike classical pre-conditioning, where only the gradients are multiplied by a pre-conditioner, the proposed pre-conditioning modifies both the gradients and the consensus terms, thereby controlling the effect of the communication graph on the algorithm.

关键词： Logistic regression Accelerated aging consensus algorithm Cost function Convex functions Peer-to-peer computing Linear matrix inequalities Standards Convergence Lyapunov methods

来源：评论

学校读者我要写书评

暂无评论

On Linear Convergence of PI consensus algorithm under the Restricted Secant Inequality

arXiv

引用

arXiv 2023年

作者： Chakrabarti, Kushal Baranwal, Mayank Division of Data & Decision Sciences Tata Consultancy Services Research Mumbai400607 India Faculty of Systems & Control Engineering Indian Institute of Technology India

This paper considers solving distributed optimization problems in peer-to-peer multi-agent networks. The network is synchronous and connected. By using the proportional-integral (PI) control strategy, various algorithms with fixed stepsize have been developed. Two notable among them are the PI algorithm and the PI consensus algorithm. Although the PI algorithm has provable linear or exponential convergence without the standard requirement of (strong) convexity, a similar guarantee for the PI consensus algorithm is unavailable. In this paper, using Lyapunov theory, we guarantee exponential convergence of the PI consensus algorithm for global cost functions that satisfy the restricted secant inequality, with rate-matching discretization, without requiring convexity. To accelerate the PI consensus algorithm, we incorporate local preconditioning in the form of constant positive definite matrices and numerically validate its efficiency compared to the prominent distributed convex optimization algorithms. Unlike classical pre-conditioning, where only the gradients are multiplied by a pre-conditioner, the proposed pre-conditioning modifies both the gradients and the consensus terms, thereby controlling the effect of the communication graph on the algorithm. Copyright © 2023, The Authors. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

RBFT: An Improved Blockchain consensus algorithm Based on RPCA and PBFT

RBFT: An Improved Blockchain Consensus Algorithm Based on RP...

引用

Computer Science and Blockchain (CCSB), International Conference on

作者： Hongyu Chen Jianhui Ma University of Science and Technology of China Hefei China

ISBN: (数字)9798350356502

ISBN: (纸本)9798350356519

RPCA consensus algorithm is not suitable for consortium chains, and the performance of the PBFT consensus algorithm decreases as the number of nodes increases, this paper proposes an RBFT consensus algorithm based on RPCA and PBFT. This algorithm proposes a credit score model based on a reward and punishment mechanism. According to the performance of node in the consensus dynamically updates the node credit score and uses it as the only basis for the node to be selected into UNL. PBFT is used in the UNL to enhance the reliability of the consensus. Experimental results confirm that RBFT effectively improves consensus efficiency and security based on RPCA and PBFT.

关键词： Computer science Heuristic algorithms consensus algorithm Throughput Blockchains Security Reliability

来源：评论

学校读者我要写书评

暂无评论

Albatross An Optimistic consensus algorithm

arXiv

引用

arXiv 2019年

作者： Berrang, Pascal Cruz, Inês França, Bruno von Styp-Rekowsky, Philipp Wissfeld, Marvin Nimiq Foundation

The consensus protocol is a critical component of distributed ledgers and blockchains. Achieving consensus over a decentralized network poses challenges to transaction finality and performance. Currently, the highest-performing consensus algorithms are speculative BFT algorithms, which, however, compromise on the transaction finality guarantees offered by their non-speculative counterparts. In this paper, we introduce Albatross, a Proof-of-Stake (PoS) blockchain consensus algorithm that aims to combine the best of both worlds. At its heart, Albatross is a speculative BFT algorithm designed to provide strong probabilistic finality and high performance. We complement this by periodically establishing finality through the Tendermint protocol. We prove our protocol to be secure under standard BFT assumptions and analyze its performance both on a theoretical and practical level. For that, we provide an open-source Rust implementation of Albatross. Our real-world measurements support that our protocol has performance characteristics close to the theoretical maximum for single-chain Proof-of-Stake consensus algorithms. © 2019, CC BY-SA.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

QPBFT: Practical Byzantine Fault Tolerance consensus algorithm Based on Quantified-Role

QPBFT: Practical Byzantine Fault Tolerance Consensus Algorit...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Zhujun Zhang Dali Zhu Wei Fan Institute of Information Engineering Chinese Academy of Sciences School of Cyber Security University of Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China

ISBN: (数字)9781665403924

ISBN: (纸本)9781665403931

Practical Byzantine Fault Tolerance (PBFT) is an optional consensus protocol for consortium blockchains scenarios where strong consistency is required. However, it also inevitably incurs high energy consumption, low efficiency and poor scalability. What is more, the reliability of the consensus node cannot be guaranteed by itself. For addressing these problems, this paper proposes practical byzantine consensus algorithm based on quantified-role (QPBFT), which can achieve the following advantages: (1) Improving the security and reliability of the blockchain. The reliability attributes of nodes are quantified based on analytic hierarchy process (AHP), those nodes with high reliability evaluation scores are more likely to participate in block production by introduction of the quantified-role, which can ensure the reliability of blockchain network; (2) Realizing high efficiency and low energy consumption. Voting mechanism is adopted to simplify and optimize the PBFT consensus process; (3) Implementing adaptation to dynamic network environments. Management nodes, voting nodes, candidate nodes, and ordinary nodes are dynamically adjusted according to node reliability evaluation score for optimizing consensus performance. The paper demonstrates the security feature including reliability and fault tolerance. Meanwhile, simulation experiments are conducted to validate the higher efficiency and less resource consumption of QPBFT compared with PBFT.

关键词： Fault tolerance Energy consumption Fault tolerant systems Blockchain consensus algorithm Production Security

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：