GT-NRSM: efficient and scalable sharding consensus mechanism for consortium blockchain

Blockchain is an innovative application of distributed storage, consensus mechanism, cryptographic algorithm, and other computer technologies. As the underlying architecture of blockchain, consensus is the key to realizing service-oriented applications of blockchain in terms of its security, efficie...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:The Journal of supercomputing Ročník 79; číslo 17; s. 20041 - 20075
Hlavní autoři: Shen, Tao, Li, Tianyu, Yu, Zhuo, Bai, Fenhua, Zhang, Chi
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.11.2023
Springer Nature B.V
Témata:
Algorithms
Blockchain
Communication
Compilers
Complexity
Computer Science
Consortia
Cryptography
Decentralization
Design
Digital currencies
Distributed ledger
Efficiency
Fault tolerance
Interpreters
Leadership
Network latency
Nodes
Performance evaluation
Processor Architectures
Programming Languages
Security
Supervision
Shard
Leader election
Consensus
Guarantee tree
Blockchain
ISSN:0920-8542, 1573-0484
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Blockchain is an innovative application of distributed storage, consensus mechanism, cryptographic algorithm, and other computer technologies. As the underlying architecture of blockchain, consensus is the key to realizing service-oriented applications of blockchain in terms of its security, efficiency, and scalability optimization. In some high-complexity consensus, such as Practical Byzantine Fault Tolerance (PBFT), throughput is severely reduced as the number of nodes increases. Even in low-complexity algorithms such as Raft, the load on the leader is severely affected as the network size increases, negatively affecting consensus efficiency. To solve these problems, we propose a node reliable shard model based on guarantee tree that achieves high scalability while maintaining a certain degree of decentralization and security based on consortium blockchain. Firstly, we create a guarantee mechanism to represent the trust relationship between nodes, and then, we design a reliable node selection strategy based on the guarantee mechanism to evaluate the node guarantee results and consensus behavior, determine the node trust status, and identify malicious nodes and choose a list of trusted leaders. Secondly, we propose a Dual-Leaders supervision mechanism, in which the deputy senses the heartbeat of leader while the deputy activity is detected by consensus nodes. Finally, we use a guarantee mechanism and reliable node selection strategy to design a network partitioning method to achieve high concurrent consensus for multiple partitions and significantly improve consensus efficiency. Subsequent experiments show that the throughput of the proposed algorithm improves by 48% over Raft and is significantly greater than PBFT, which has better throughput but lower consensus latency.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0920-8542
1573-0484
DOI:10.1007/s11227-023-05414-w