VioLinn: Proximity-aware Edge Placementwith Dynamic and Elastic Resource Provisioning

IF 3.5 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS ACM Transactions on Internet of Things Pub Date : 2022-12-05 DOI:10.1145/3573125
Klervie Toczé, Ali J. Fahs, G. Pierre, S. Nadjm-Tehrani
{"title":"VioLinn: Proximity-aware Edge Placementwith Dynamic and Elastic Resource Provisioning","authors":"Klervie Toczé, Ali J. Fahs, G. Pierre, S. Nadjm-Tehrani","doi":"10.1145/3573125","DOIUrl":null,"url":null,"abstract":"Deciding where to handle services and tasks, as well as provisioning an adequate amount of computing resources for this handling, is a main challenge of edge computing systems. Moreover, latency-sensitive services constrain the type and location of edge devices that can provide the needed resources. When available resources are scarce there is a possibility that some resource allocation requests are denied. In this work, we propose the VioLinn system to tackle the joint problems of task placement, service placement, and edge device provisioning. Dealing with latency-sensitive services is achieved through proximity-aware algorithms that ensure the tasks are handled close to the end-user. Moreover, the concept of spare edge device is introduced to handle sudden load variations in time and space without having to continuously overprovision. Several spare device selection algorithms are proposed with different cost/performance tradeoffs. Evaluations are performed both in a Kubernetes-based testbed and using simulations and show the benefit of using spare devices for handling localized load spikes with higher quality of service (QoS) and lower computing resource usage. The study of the different algorithms shows that it is possible to achieve this increase in QoS with different tradeoffs against cost and performance.","PeriodicalId":29764,"journal":{"name":"ACM Transactions on Internet of Things","volume":"29 1","pages":"1 - 31"},"PeriodicalIF":3.5000,"publicationDate":"2022-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Internet of Things","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3573125","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Deciding where to handle services and tasks, as well as provisioning an adequate amount of computing resources for this handling, is a main challenge of edge computing systems. Moreover, latency-sensitive services constrain the type and location of edge devices that can provide the needed resources. When available resources are scarce there is a possibility that some resource allocation requests are denied. In this work, we propose the VioLinn system to tackle the joint problems of task placement, service placement, and edge device provisioning. Dealing with latency-sensitive services is achieved through proximity-aware algorithms that ensure the tasks are handled close to the end-user. Moreover, the concept of spare edge device is introduced to handle sudden load variations in time and space without having to continuously overprovision. Several spare device selection algorithms are proposed with different cost/performance tradeoffs. Evaluations are performed both in a Kubernetes-based testbed and using simulations and show the benefit of using spare devices for handling localized load spikes with higher quality of service (QoS) and lower computing resource usage. The study of the different algorithms shows that it is possible to achieve this increase in QoS with different tradeoffs against cost and performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
动态和弹性资源配置的邻近感知边缘放置
决定在哪里处理服务和任务,以及为这种处理提供足够的计算资源,是边缘计算系统的主要挑战。此外,对延迟敏感的服务限制了能够提供所需资源的边缘设备的类型和位置。当可用资源稀缺时,一些资源分配请求可能会被拒绝。在这项工作中,我们提出VioLinn系统来解决任务放置、服务放置和边缘设备供应的联合问题。处理对延迟敏感的服务是通过邻近感知算法实现的,该算法确保任务在靠近最终用户的地方处理。此外,引入了备用边缘设备的概念,以处理时间和空间上的突然负载变化,而不必持续过度供应。提出了几种具有不同成本/性能权衡的备用设备选择算法。评估在基于kubernetes的测试平台和模拟中执行,并显示了使用备用设备处理局部负载峰值的好处,具有更高的服务质量(QoS)和更低的计算资源使用。对不同算法的研究表明,通过对成本和性能的不同权衡来实现QoS的增加是可能的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
5.20
自引率
3.70%
发文量
0
期刊最新文献
Introduction to the Special Issue on Wireless Sensing for IoT Special Issue on Wireless Sensing for IoT: A Word from the Editor-in-Chief Resilient Intermediary‐Based Key Exchange Protocol for IoT A Two-Mode, Adaptive Security Framework for Smart Home Security Applications Online learning for dynamic impending collision prediction using FMCW radar
×
引用
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