Towards fairness and QoE-based edge allocation for multiplayer virtual reality applications in edge computing

Athanasios Tsipis, Vasileios Komianos, Konstantinos Oikonomou, Ioannis Stavrakakis
{"title":"Towards fairness and QoE-based edge allocation for multiplayer virtual reality applications in edge computing","authors":"Athanasios Tsipis, Vasileios Komianos, Konstantinos Oikonomou, Ioannis Stavrakakis","doi":"10.52953/vavy1919","DOIUrl":null,"url":null,"abstract":"Edge computing has emerged as the next big thing in distributed computing, by extending the cloud paradigm and offering efficient ways to engage with latency-intolerant applications, such as Virtual Reality (VR) multiplayer games. In edge computing, the service providers can benefit from existing cellular infrastructure to deploy services on edge servers that reside in close proximity to the users. Given the limited available budget for edge resource investment, one fundamental problem that manifests is the discovery of a prudent edge allocation strategy, that will efficiently prescribe which users are assigned to which edge servers, in order to tackle application-specific requirements, like minimizing system deployment costs. In this paper, considering the frequent interactions and view inconsistencies occurring among multiple users immersed in the same VR game, we address the problem from the users' perspective, focusing on improving their edge admission rate, resource provisioning and overall fairness, in order to subsequently maximize the average Quality of Experience (QoE). We call this the \"Fairness and QoE-Based Edge Allocation\" (FQEA) problem, formally formulating its properties and theoretically proving its complexity. However, discovering optimal solutions to the NP-hard FQEA in large-scale VR scenarios is challenging. Hence, we propose FQEA-H, a heuristic algorithm to generate allocation strategies in reasonable time. Comprehensive simulations, conducted on a real-world topological trace, demonstrate how FQEA-H can tackle the problem effectively, generally outperforming both the baseline and state-of-the-art alternatives.","PeriodicalId":274720,"journal":{"name":"ITU Journal on Future and Evolving Technologies","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ITU Journal on Future and Evolving Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52953/vavy1919","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Edge computing has emerged as the next big thing in distributed computing, by extending the cloud paradigm and offering efficient ways to engage with latency-intolerant applications, such as Virtual Reality (VR) multiplayer games. In edge computing, the service providers can benefit from existing cellular infrastructure to deploy services on edge servers that reside in close proximity to the users. Given the limited available budget for edge resource investment, one fundamental problem that manifests is the discovery of a prudent edge allocation strategy, that will efficiently prescribe which users are assigned to which edge servers, in order to tackle application-specific requirements, like minimizing system deployment costs. In this paper, considering the frequent interactions and view inconsistencies occurring among multiple users immersed in the same VR game, we address the problem from the users' perspective, focusing on improving their edge admission rate, resource provisioning and overall fairness, in order to subsequently maximize the average Quality of Experience (QoE). We call this the "Fairness and QoE-Based Edge Allocation" (FQEA) problem, formally formulating its properties and theoretically proving its complexity. However, discovering optimal solutions to the NP-hard FQEA in large-scale VR scenarios is challenging. Hence, we propose FQEA-H, a heuristic algorithm to generate allocation strategies in reasonable time. Comprehensive simulations, conducted on a real-world topological trace, demonstrate how FQEA-H can tackle the problem effectively, generally outperforming both the baseline and state-of-the-art alternatives.
边缘计算中多人虚拟现实应用的公平性和基于qos的边缘分配
边缘计算已经成为分布式计算的下一个热点,它扩展了云范式,并提供了有效的方法来处理延迟不容忍的应用程序,比如虚拟现实(VR)多人游戏。在边缘计算中,服务提供商可以从现有的蜂窝基础设施中获益,在靠近用户的边缘服务器上部署服务。考虑到边缘资源投资的可用预算有限,出现的一个基本问题是发现谨慎的边缘分配策略,该策略将有效地规定将哪些用户分配给哪些边缘服务器,以解决特定于应用程序的需求,例如最小化系统部署成本。考虑到沉浸在同一款VR游戏中的多个用户之间频繁的交互和视图不一致,我们从用户的角度来解决这个问题,重点关注提高他们的边缘准入率、资源供应和整体公平性,从而最大化平均体验质量(QoE)。我们将其称为“公平和基于qos的边缘分配”(FQEA)问题,从形式上阐述了其性质并从理论上证明了其复杂性。然而,在大规模VR场景中找到NP-hard FQEA的最佳解决方案是具有挑战性的。因此,我们提出了一种启发式算法FQEA-H,以在合理的时间内生成分配策略。在现实世界的拓扑轨迹上进行的综合模拟,证明了FQEA-H如何有效地解决问题,通常优于基线和最先进的替代方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信