Blockchain-enabled dispersed computing paradigm in Web 3.0 metaverse

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Zhonghui Wu , Changqiao Xu , Mu Wang , Yunxiao Ma , Zicong Huang , Jingtian Liu , Han Xiao , Lujie Zhong , Luigi Alfredo Grieco
{"title":"Blockchain-enabled dispersed computing paradigm in Web 3.0 metaverse","authors":"Zhonghui Wu ,&nbsp;Changqiao Xu ,&nbsp;Mu Wang ,&nbsp;Yunxiao Ma ,&nbsp;Zicong Huang ,&nbsp;Jingtian Liu ,&nbsp;Han Xiao ,&nbsp;Lujie Zhong ,&nbsp;Luigi Alfredo Grieco","doi":"10.1016/j.comnet.2025.111378","DOIUrl":null,"url":null,"abstract":"<div><div>The metaverse is rapidly gaining momentum, thanks to its inherent capabilities to create an immersive virtual environment that runs in parallel to the physical world. At the same time, it raises new technical challenges due to its unique characteristics. On the one hand, metaverse applications are composed of multiple computing sub-tasks, and performing these sub-tasks sequentially can hinder computational efficiency. On the other hand, current centralized task offloading for metaverse applications is contrary to the core concept of Web 3.0. Moreover, fair incentives for all participants are not fully considered. To address these issues, a new computing paradigm for metaverse is required. Hence, we propose a Blockchain-enabled Intelligent Dispersed Computing Framework (BIDC). In this paper, we first design a two-layered architecture and model the sub-tasks as a directed acyclic graph (DAG) by utilizing their dependent relations. Inspired by the interconnection of blocks in blockchain, BIDC transforms the execution process of sub-tasks into a mining process, cleverly integrating task computation with mining. On this basis, Mining Mechanism and Main Chain Confirmation Mechanisms are presented, to ensure the efficiency of task offloading and the fairness of reward distribution. Then BIDC transforms the overhead time minimization problem into a multi-party mining problem. By leveraging Actor-Critic-based Multi-Agent Reinforcement Learning, every device can dynamically adjust its own mining strategy to achieve the lowest latency. At last, experimental results demonstrate BIDC’s reliability, scalability, and superior service quality compared to existing state-of-the-art solutions.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"268 ","pages":"Article 111378"},"PeriodicalIF":4.6000,"publicationDate":"2025-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625003457","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

The metaverse is rapidly gaining momentum, thanks to its inherent capabilities to create an immersive virtual environment that runs in parallel to the physical world. At the same time, it raises new technical challenges due to its unique characteristics. On the one hand, metaverse applications are composed of multiple computing sub-tasks, and performing these sub-tasks sequentially can hinder computational efficiency. On the other hand, current centralized task offloading for metaverse applications is contrary to the core concept of Web 3.0. Moreover, fair incentives for all participants are not fully considered. To address these issues, a new computing paradigm for metaverse is required. Hence, we propose a Blockchain-enabled Intelligent Dispersed Computing Framework (BIDC). In this paper, we first design a two-layered architecture and model the sub-tasks as a directed acyclic graph (DAG) by utilizing their dependent relations. Inspired by the interconnection of blocks in blockchain, BIDC transforms the execution process of sub-tasks into a mining process, cleverly integrating task computation with mining. On this basis, Mining Mechanism and Main Chain Confirmation Mechanisms are presented, to ensure the efficiency of task offloading and the fairness of reward distribution. Then BIDC transforms the overhead time minimization problem into a multi-party mining problem. By leveraging Actor-Critic-based Multi-Agent Reinforcement Learning, every device can dynamically adjust its own mining strategy to achieve the lowest latency. At last, experimental results demonstrate BIDC’s reliability, scalability, and superior service quality compared to existing state-of-the-art solutions.
Web 3.0元宇宙中支持区块链的分散计算范式
由于其固有的能力,虚拟世界正在迅速获得动力,创造一个沉浸式的虚拟环境,与物理世界并行运行。同时,由于其独特的特性,它提出了新的技术挑战。一方面,元宇宙应用程序由多个计算子任务组成,依次执行这些子任务可能会影响计算效率。另一方面,当前面向元应用程序的集中式任务卸载与Web 3.0的核心概念相悖。此外,没有充分考虑对所有参与者的公平激励。为了解决这些问题,需要一种新的元宇宙计算范式。因此,我们提出了一个支持区块链的智能分散计算框架(BIDC)。本文首先设计了一种双层结构,并利用子任务之间的依赖关系将子任务建模为有向无环图(DAG)。受区块链中区块互联的启发,BIDC将子任务的执行过程转化为挖掘过程,将任务计算与挖掘巧妙地结合在一起。在此基础上,提出了挖矿机制和主链确认机制,以保证任务卸载的效率和奖励分配的公平性。然后,BIDC将开销时间最小化问题转化为多方挖掘问题。通过利用基于actor - critical的多智能体强化学习,每个设备都可以动态调整自己的挖掘策略,以实现最低的延迟。最后,实验结果表明,与现有最先进的解决方案相比,BIDC具有可靠性、可扩展性和卓越的服务质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信