CRESP:以成本为导向的边缘服务提供

IF 6.6 1区 计算机科学 Q1 Multidisciplinary
Li Huang;Bo Li;Lu Zhao
{"title":"CRESP:以成本为导向的边缘服务提供","authors":"Li Huang;Bo Li;Lu Zhao","doi":"10.26599/TST.2024.9010151","DOIUrl":null,"url":null,"abstract":"In the 5G environment, the edge computing paradigm enables service providers to deploy their service instances on distributed edge servers to serve nearby end users with extremely low latency. This boosts the emergence of modern applications, like AR/VR, online gaming, and autonomous vehicles. Existing approaches find service provision strategies under the assumption that all the user requirements are known. However, this assumption may not be true in practice and thus the effectiveness of existing approaches could be undermined. Inspired by the great success of recommender systems in various fields, we can mine users' interests in new services based on their similarities in terms of current service usage. Then, new service instances can be provisioned accordingly to better fulfil users' requirements. We formulate the problem studied in this paper as a Cost-aware Recommendation-oriented Edge Service Provision (CRESP) problem. Then, we formally model the CRESP problem as a Constrained Optimization Problem (COP). Next, we propose CRESP-O to find optimal solutions to small-scale CRESP problems. Besides, to solve large-scale CRESP problems efficiently, we propose an approximation approach named CRESP-A, which has a theoretical performance guarantee. Finally, we experimentally evaluate the performance of both CRESP-O and CRESP-A against several state-of-the-art approaches on a public testbed.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 4","pages":"1865-1884"},"PeriodicalIF":6.6000,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10908596","citationCount":"0","resultStr":"{\"title\":\"CRESP: Cost-Aware Recommendation-Oriented Edge Service Provision\",\"authors\":\"Li Huang;Bo Li;Lu Zhao\",\"doi\":\"10.26599/TST.2024.9010151\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the 5G environment, the edge computing paradigm enables service providers to deploy their service instances on distributed edge servers to serve nearby end users with extremely low latency. This boosts the emergence of modern applications, like AR/VR, online gaming, and autonomous vehicles. Existing approaches find service provision strategies under the assumption that all the user requirements are known. However, this assumption may not be true in practice and thus the effectiveness of existing approaches could be undermined. Inspired by the great success of recommender systems in various fields, we can mine users' interests in new services based on their similarities in terms of current service usage. Then, new service instances can be provisioned accordingly to better fulfil users' requirements. We formulate the problem studied in this paper as a Cost-aware Recommendation-oriented Edge Service Provision (CRESP) problem. Then, we formally model the CRESP problem as a Constrained Optimization Problem (COP). Next, we propose CRESP-O to find optimal solutions to small-scale CRESP problems. Besides, to solve large-scale CRESP problems efficiently, we propose an approximation approach named CRESP-A, which has a theoretical performance guarantee. Finally, we experimentally evaluate the performance of both CRESP-O and CRESP-A against several state-of-the-art approaches on a public testbed.\",\"PeriodicalId\":48690,\"journal\":{\"name\":\"Tsinghua Science and Technology\",\"volume\":\"30 4\",\"pages\":\"1865-1884\"},\"PeriodicalIF\":6.6000,\"publicationDate\":\"2025-03-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10908596\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Tsinghua Science and Technology\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10908596/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Multidisciplinary\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tsinghua Science and Technology","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10908596/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Multidisciplinary","Score":null,"Total":0}
引用次数: 0

摘要

在5G环境中,边缘计算范式使服务提供商能够将其服务实例部署在分布式边缘服务器上,以极低的延迟为附近的最终用户提供服务。这推动了AR/VR、在线游戏和自动驾驶汽车等现代应用的出现。现有方法在假设所有用户需求都已知的情况下寻找服务提供策略。然而,这一假设在实践中可能并不正确,因此现有办法的有效性可能受到损害。受推荐系统在各个领域取得巨大成功的启发,我们可以根据用户在当前服务使用方面的相似性来挖掘用户对新服务的兴趣。然后,可以相应地提供新的服务实例,以更好地满足用户的需求。我们将本文研究的问题描述为一个成本意识的推荐导向边缘服务提供(CRESP)问题。然后,我们将CRESP问题正式建模为约束优化问题(COP)。接下来,我们提出了CRESP- o来寻找小规模CRESP问题的最优解。此外,为了有效地解决大规模的CRESP问题,我们提出了一种具有理论性能保证的近似方法——CRESP- a。最后,我们在公共测试平台上对几种最先进的方法对CRESP-O和CRESP-A的性能进行了实验评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
CRESP: Cost-Aware Recommendation-Oriented Edge Service Provision
In the 5G environment, the edge computing paradigm enables service providers to deploy their service instances on distributed edge servers to serve nearby end users with extremely low latency. This boosts the emergence of modern applications, like AR/VR, online gaming, and autonomous vehicles. Existing approaches find service provision strategies under the assumption that all the user requirements are known. However, this assumption may not be true in practice and thus the effectiveness of existing approaches could be undermined. Inspired by the great success of recommender systems in various fields, we can mine users' interests in new services based on their similarities in terms of current service usage. Then, new service instances can be provisioned accordingly to better fulfil users' requirements. We formulate the problem studied in this paper as a Cost-aware Recommendation-oriented Edge Service Provision (CRESP) problem. Then, we formally model the CRESP problem as a Constrained Optimization Problem (COP). Next, we propose CRESP-O to find optimal solutions to small-scale CRESP problems. Besides, to solve large-scale CRESP problems efficiently, we propose an approximation approach named CRESP-A, which has a theoretical performance guarantee. Finally, we experimentally evaluate the performance of both CRESP-O and CRESP-A against several state-of-the-art approaches on a public testbed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Tsinghua Science and Technology
Tsinghua Science and Technology COMPUTER SCIENCE, INFORMATION SYSTEMSCOMPU-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
10.20
自引率
10.60%
发文量
2340
期刊介绍: Tsinghua Science and Technology (Tsinghua Sci Technol) started publication in 1996. It is an international academic journal sponsored by Tsinghua University and is published bimonthly. This journal aims at presenting the up-to-date scientific achievements in computer science, electronic engineering, and other IT fields. Contributions all over the world are welcome.
×
引用
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学术官方微信