Byzantine容错
一致性算法
计算机科学
分布式计算
事务处理
一致共识
延迟(音频)
可靠性(半导体)
共识
数据库事务
知识产权
散列函数
声誉
计算机网络
容错
算法
计算机安全
多智能体系统
电信
人工智能
量子力学
操作系统
物理
社会学
功率(物理)
社会科学
程序设计语言
作者
Wang Zhong,Wenlong Feng,Mengxing Huang,Siling Feng
出处
期刊:Electronics
日期:2023-01-08
卷期号:12 (2): 325-325
被引量:3
标识
DOI:10.3390/electronics12020325
摘要
For the current Intellectual Property (IP) transaction scenario, consensus nodes need to simultaneously consensus transactions of the same transaction type, resulting in low consensus efficiency, accuracy, and reliability, which seriously hinders the development of intellectual property. Based on the consortium chain, this paper proposes a secure and efficient blockchain-distributed consensus algorithm, ST-PBFT (Shard Transaction Practical Byzantine Fault Tolerance), applied to the IP transaction scenario. The main contributions of ST-PBFT include the following: first, a grouping method based on the principle of consistent hashing is proposed to group consensus nodes, and nodes group consensus, which reduces the complexity of communication. Second, the transaction consensus group can process IP transactions in parallel, which improves the throughput of the algorithm. Third, a node reputation evaluation model is proposed, which can prevent byzantine nodes from being repeatedly elected as primary nodes. The experimental results show that ST-PBFT can significantly improve the consensus efficiency and reliability and reduce consensus latency.
科研通智能强力驱动
Strongly Powered by AbleSci AI