Cloud-Edge-End Collaborative Dependent Computing Schedule Strategy for Immersive Media

IF 2.5 4区 计算机科学 Q3 TELECOMMUNICATIONS
Xiaoxi Wang, Shujie Yang, Hong Tang, Xueying Li, Wei Wang, Hui Xiao, Yuxing Liu, Jia Chen, Enbo Wang, Shaoyun Wu, Mingyu Zhao
{"title":"Cloud-Edge-End Collaborative Dependent Computing Schedule Strategy for Immersive Media","authors":"Xiaoxi Wang,&nbsp;Shujie Yang,&nbsp;Hong Tang,&nbsp;Xueying Li,&nbsp;Wei Wang,&nbsp;Hui Xiao,&nbsp;Yuxing Liu,&nbsp;Jia Chen,&nbsp;Enbo Wang,&nbsp;Shaoyun Wu,&nbsp;Mingyu Zhao","doi":"10.1002/ett.70247","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Immersive media applications often create an immersive experience for users through head-mounted displays. However, the computing power and storage capacity of terminal devices are limited, and the local computing architecture cannot meet the high resolution and low latency requirements of panoramic video frames. As a new computing paradigm, cloud, edge and end collaborative computing architecture selectively schedules computing tasks to cloud servers and edge servers with higher computing power, which can effectively improve computing efficiency. However, for dependent computational tasks, the scheduling of each task needs to consider its previous tasks, network state, and computational resources of different servers. Therefore, how to make computational offloading decisions and resource allocation for dependent tasks is a key issue for collaborative computing architectures. This paper investigates and analyzes the immersive media scenarios and the basic computation offloading strategies, and construct a dependent task model graph and optimization problem model. Based on threshold strategy, greedy strategy of heuristic algorithm and deep reinforcement learning model, a scheduling strategy under collaborative computing architecture is designed to maximize the reward related to delay and cost. Finally, the basic performance of the computational task scheduling strategy based on deep reinforcement learning and greedy policy is verified through simulation experiments. The experimental results show that the algorithm reduces the latency by more than 1.8 ms and increases the timely completion rate by more than <span></span><math></math> relative to several basic scheduling schemes, which can effectively improve the service quality and user experience.</p>\n </div>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"36 10","pages":""},"PeriodicalIF":2.5000,"publicationDate":"2025-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Emerging Telecommunications Technologies","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/ett.70247","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Immersive media applications often create an immersive experience for users through head-mounted displays. However, the computing power and storage capacity of terminal devices are limited, and the local computing architecture cannot meet the high resolution and low latency requirements of panoramic video frames. As a new computing paradigm, cloud, edge and end collaborative computing architecture selectively schedules computing tasks to cloud servers and edge servers with higher computing power, which can effectively improve computing efficiency. However, for dependent computational tasks, the scheduling of each task needs to consider its previous tasks, network state, and computational resources of different servers. Therefore, how to make computational offloading decisions and resource allocation for dependent tasks is a key issue for collaborative computing architectures. This paper investigates and analyzes the immersive media scenarios and the basic computation offloading strategies, and construct a dependent task model graph and optimization problem model. Based on threshold strategy, greedy strategy of heuristic algorithm and deep reinforcement learning model, a scheduling strategy under collaborative computing architecture is designed to maximize the reward related to delay and cost. Finally, the basic performance of the computational task scheduling strategy based on deep reinforcement learning and greedy policy is verified through simulation experiments. The experimental results show that the algorithm reduces the latency by more than 1.8 ms and increases the timely completion rate by more than relative to several basic scheduling schemes, which can effectively improve the service quality and user experience.

Abstract Image

沉浸式媒体的云-边缘协同依赖计算调度策略
沉浸式媒体应用通常通过头戴式显示器为用户创造沉浸式体验。但终端设备的计算能力和存储容量有限,本地计算架构无法满足全景视频帧的高分辨率、低时延要求。云、边缘和端协同计算架构作为一种新的计算范式,有选择地将计算任务调度到计算能力更高的云服务器和边缘服务器上,可以有效地提高计算效率。然而,对于依赖的计算任务,每个任务的调度需要考虑其先前的任务、网络状态和不同服务器的计算资源。因此,如何对依赖任务进行计算卸载决策和资源分配是协作计算体系结构的关键问题。研究和分析了沉浸式媒体场景和基本的计算卸载策略,构建了相关任务模型图和优化问题模型。基于阈值策略、启发式算法的贪心策略和深度强化学习模型,设计了协同计算架构下的调度策略,使延迟和成本相关的奖励最大化。最后,通过仿真实验验证了基于深度强化学习和贪婪策略的计算任务调度策略的基本性能。实验结果表明,与几种基本调度方案相比,该算法延迟降低1.8 ms以上,及时完成率提高超过1.8 ms,能够有效提高服务质量和用户体验。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
8.90
自引率
13.90%
发文量
249
期刊介绍: ransactions on Emerging Telecommunications Technologies (ETT), formerly known as European Transactions on Telecommunications (ETT), has the following aims: - to attract cutting-edge publications from leading researchers and research groups around the world - to become a highly cited source of timely research findings in emerging fields of telecommunications - to limit revision and publication cycles to a few months and thus significantly increase attractiveness to publish - to become the leading journal for publishing the latest developments in telecommunications
×
引用
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学术官方微信