High-performance BFT consensus for Metaverse through block linking and shortcut loop

IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Rui Hao , Chaozheng Ding , Xiaohai Dai , Hao Fan , Jianwen Xiang
{"title":"High-performance BFT consensus for Metaverse through block linking and shortcut loop","authors":"Rui Hao ,&nbsp;Chaozheng Ding ,&nbsp;Xiaohai Dai ,&nbsp;Hao Fan ,&nbsp;Jianwen Xiang","doi":"10.1016/j.comcom.2024.107990","DOIUrl":null,"url":null,"abstract":"<div><div>In recent years, the Metaverse has captured increasing attention. As the foundational technologies for these digital realms, blockchain systems and their critical component – <em>the Byzantine Fault Tolerance</em> (BFT) consensus protocol – significantly influence the performance of Metaverse. Due to vulnerabilities to network attacks, synchronous and partially synchronous consensus protocols often face compromises in their liveness or security. Consequently, recent efforts in BFT consensus have shifted towards asynchronous consensus protocols, notably the <em>Multi-valued Validated Binary Agreement</em> (MVBA) protocols, with sMVBA being particularly prominent. Despite its advances, sMVBA struggles to meet the high-performance demands of Metaverse applications. Each sMVBA instance commits only one block, discarding all others, which severely restricts throughput. Moreover, if a leader in a given view crashes, nodes must rebroadcast blocks in the subsequent view, resulting in increased latency.</div><div>To overcome these challenges, this paper introduces <span>Mercury</span>, a protocol designed to enhance throughput under various conditions and reduce latency in less favorable scenarios where leaders are crashed. <span>Mercury</span> incorporates a mechanism whereby each block contains hashes from blocks of a previous instance, linking blocks across instances. This structure ensures that once a block is committed, all its linked blocks are also committed, thereby boosting throughput. Additionally, <span>Mercury</span> integrates a ‘shortcut loop’ mechanism, allowing nodes to bypass the last phase of the current view and the block broadcasting in the next view, significantly decreasing latency. Our experimental evaluations of <span>Mercury</span> confirm its superior performance. Compared to the cutting-edge protocols, sMVBA, CKPS, and AMS, <span>Mercury</span> boosts throughput by 1.03X, 1.65X, and 2.51X, respectively.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107990"},"PeriodicalIF":4.5000,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Communications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0140366424003372","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In recent years, the Metaverse has captured increasing attention. As the foundational technologies for these digital realms, blockchain systems and their critical component – the Byzantine Fault Tolerance (BFT) consensus protocol – significantly influence the performance of Metaverse. Due to vulnerabilities to network attacks, synchronous and partially synchronous consensus protocols often face compromises in their liveness or security. Consequently, recent efforts in BFT consensus have shifted towards asynchronous consensus protocols, notably the Multi-valued Validated Binary Agreement (MVBA) protocols, with sMVBA being particularly prominent. Despite its advances, sMVBA struggles to meet the high-performance demands of Metaverse applications. Each sMVBA instance commits only one block, discarding all others, which severely restricts throughput. Moreover, if a leader in a given view crashes, nodes must rebroadcast blocks in the subsequent view, resulting in increased latency.
To overcome these challenges, this paper introduces Mercury, a protocol designed to enhance throughput under various conditions and reduce latency in less favorable scenarios where leaders are crashed. Mercury incorporates a mechanism whereby each block contains hashes from blocks of a previous instance, linking blocks across instances. This structure ensures that once a block is committed, all its linked blocks are also committed, thereby boosting throughput. Additionally, Mercury integrates a ‘shortcut loop’ mechanism, allowing nodes to bypass the last phase of the current view and the block broadcasting in the next view, significantly decreasing latency. Our experimental evaluations of Mercury confirm its superior performance. Compared to the cutting-edge protocols, sMVBA, CKPS, and AMS, Mercury boosts throughput by 1.03X, 1.65X, and 2.51X, respectively.
通过区块链接和快捷循环实现高性能元宇宙 BFT 共识
近年来,"元宇宙"(Metaverse)受到越来越多的关注。作为这些数字领域的基础技术,区块链系统及其关键组件--拜占庭容错(BFT)共识协议--极大地影响着元宇宙的性能。由于容易受到网络攻击,同步和部分同步共识协议的有效性或安全性经常受到影响。因此,最近在 BFT 共识方面的努力转向了异步共识协议,特别是多值验证二进制协议(MVBA),其中 sMVBA 尤为突出。尽管 sMVBA 取得了进步,但它仍难以满足 Metaverse 应用程序的高性能要求。每个 sMVBA 实例只提交一个区块,丢弃所有其他区块,这严重限制了吞吐量。为了克服这些挑战,本文介绍了 Mercury 协议,该协议旨在提高各种条件下的吞吐量,并在领导者崩溃的不利情况下减少延迟。Mercury 采用了一种机制,即每个数据块都包含前一个实例数据块的哈希值,从而在不同实例间链接数据块。这种结构可确保一旦某个区块提交,其所有链接区块也会提交,从而提高吞吐量。此外,Mercury 还集成了 "捷径循环 "机制,允许节点绕过当前视图的最后阶段和下一个视图中的区块广播,从而大大减少了延迟。我们对 Mercury 的实验评估证实了它的卓越性能。与最先进的 sMVBA、CKPS 和 AMS 协议相比,Mercury 的吞吐量分别提高了 1.03 倍、1.65 倍和 2.51 倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Communications
Computer Communications 工程技术-电信学
CiteScore
14.10
自引率
5.00%
发文量
397
审稿时长
66 days
期刊介绍: Computer and Communications networks are key infrastructures of the information society with high socio-economic value as they contribute to the correct operations of many critical services (from healthcare to finance and transportation). Internet is the core of today''s computer-communication infrastructures. This has transformed the Internet, from a robust network for data transfer between computers, to a global, content-rich, communication and information system where contents are increasingly generated by the users, and distributed according to human social relations. Next-generation network technologies, architectures and protocols are therefore required to overcome the limitations of the legacy Internet and add new capabilities and services. The future Internet should be ubiquitous, secure, resilient, and closer to human communication paradigms. Computer Communications is a peer-reviewed international journal that publishes high-quality scientific articles (both theory and practice) and survey papers covering all aspects of future computer communication networks (on all layers, except the physical layer), with a special attention to the evolution of the Internet architecture, protocols, services, and applications.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信