Scheduling Service Updates: A Multi-arm Bandit Approach

IF 2 Q3 TELECOMMUNICATIONS Journal of Computer Networks and Communications Pub Date : 2022-11-30 DOI:10.37256/cnc.1120231686
V. S. C. L. Narayana, Sucheta Ravikanti, Harsh Deshpande, Sharayu Moharir
{"title":"Scheduling Service Updates: A Multi-arm Bandit Approach","authors":"V. S. C. L. Narayana, Sucheta Ravikanti, Harsh Deshpande, Sharayu Moharir","doi":"10.37256/cnc.1120231686","DOIUrl":null,"url":null,"abstract":"Software as a Service (SaaS) instances often use edge resources to serve their customers. The version of the service hosted at the edge needs to be periodically updated to maximize the utility derived by the customers. We focus on scheduling updates in the setting where the utility derived from a version is an unknown decreasing function of the time elapsed since the version was created. We map the scheduling problem to a multi-arm bandit and propose an update policy. We characterize its performance and compare it with the fundamental limit on the performance of any online policy.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":2.0000,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer Networks and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37256/cnc.1120231686","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Software as a Service (SaaS) instances often use edge resources to serve their customers. The version of the service hosted at the edge needs to be periodically updated to maximize the utility derived by the customers. We focus on scheduling updates in the setting where the utility derived from a version is an unknown decreasing function of the time elapsed since the version was created. We map the scheduling problem to a multi-arm bandit and propose an update policy. We characterize its performance and compare it with the fundamental limit on the performance of any online policy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
调度服务更新:多臂强盗方法
软件即服务(SaaS)实例经常使用边缘资源为其客户提供服务。需要定期更新托管在边缘的服务版本,以最大限度地提高客户获得的效用。我们将重点放在以下设置中的更新调度上:从版本派生的实用程序是自版本创建以来所经过时间的未知递减函数。我们将调度问题映射到一个多臂强盗,并提出了一个更新策略。我们对其性能进行了表征,并将其与任何在线策略性能的基本限制进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
5.30
自引率
5.00%
发文量
18
审稿时长
15 weeks
期刊介绍: The Journal of Computer Networks and Communications publishes articles, both theoretical and practical, investigating computer networks and communications. Articles explore the architectures, protocols, and applications for networks across the full spectrum of sizes (LAN, PAN, MAN, WAN…) and uses (SAN, EPN, VPN…). Investigations related to topical areas of research are especially encouraged, including mobile and wireless networks, cloud and fog computing, the Internet of Things, and next generation technologies. Submission of original research, and focused review articles, is welcomed from both academic and commercial communities.
期刊最新文献
A Systematic Review of Blockchain Technology Assisted with Artificial Intelligence Technology for Networks and Communication Systems A Systematic Review of Blockchain Technology Assisted with Artificial Intelligence Technology for Networks and Communication Systems Development of an AI-Enabled Q-Agent for Making Data Offloading Decisions in a Multi-RAT Wireless Network Maximum Entropy Principle Based on Bank Customer Account Validation Using the Spark Method Detecting Application-Level Associations Between IoT Devices Using a Modified Apriori Algorithm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1