Selection of Service Nodes in Edge Computing Environments

Efthymios Oikonomou, A. Rouskas
{"title":"Selection of Service Nodes in Edge Computing Environments","authors":"Efthymios Oikonomou, A. Rouskas","doi":"10.1109/IOTSMS52051.2020.9340201","DOIUrl":null,"url":null,"abstract":"Traditional centralized mobile cloud computing is encountering severe challenges, due to the ever-increasing growth of portable smart devices, which host numerous resource-hungry applications generating exponentially growing data traffic volumes. Edge computing technology promises an increased quality of service with low communication delays by bringing the cloud closer to the end-users, at the network edge. The approach of placing server capabilities at access nodes, yielding edge service nodes, seems to be a feasible solution. In this way, proximity to service is achieved and guaranteed QoS is provided. However, keeping operational edge service nodes at every access node is energy consuming and yields increased operational expenses to the application provider when the requests for services are at low levels. In this paper, we propose algorithms to select the most appropriate access nodes to host the edge service nodes and to determine the set of access nodes that will be served by each service node, given the number of required service nodes to satisfy service computational requests and the topology of the network. We study how algorithms behave in terms of service latency and balancing of the load among service nodes, at increasing computational loads. The evaluation is performed with simulation experiments and comparison against an exhaustive search algorithm whose main goal is to minimize the latency of offered services to the access nodes. The results validate the efficiency of the proposed schemes.","PeriodicalId":147136,"journal":{"name":"2020 7th International Conference on Internet of Things: Systems, Management and Security (IOTSMS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 7th International Conference on Internet of Things: Systems, Management and Security (IOTSMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IOTSMS52051.2020.9340201","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Traditional centralized mobile cloud computing is encountering severe challenges, due to the ever-increasing growth of portable smart devices, which host numerous resource-hungry applications generating exponentially growing data traffic volumes. Edge computing technology promises an increased quality of service with low communication delays by bringing the cloud closer to the end-users, at the network edge. The approach of placing server capabilities at access nodes, yielding edge service nodes, seems to be a feasible solution. In this way, proximity to service is achieved and guaranteed QoS is provided. However, keeping operational edge service nodes at every access node is energy consuming and yields increased operational expenses to the application provider when the requests for services are at low levels. In this paper, we propose algorithms to select the most appropriate access nodes to host the edge service nodes and to determine the set of access nodes that will be served by each service node, given the number of required service nodes to satisfy service computational requests and the topology of the network. We study how algorithms behave in terms of service latency and balancing of the load among service nodes, at increasing computational loads. The evaluation is performed with simulation experiments and comparison against an exhaustive search algorithm whose main goal is to minimize the latency of offered services to the access nodes. The results validate the efficiency of the proposed schemes.
边缘计算环境下业务节点的选择
传统的集中式移动云计算正面临严峻的挑战,因为便携式智能设备的不断增长,承载了大量资源密集型应用,产生了指数级增长的数据流量。边缘计算技术通过使云更接近最终用户,在网络边缘,承诺以低通信延迟提高服务质量。将服务器功能放置在访问节点,从而产生边缘服务节点的方法似乎是一种可行的解决方案。通过这种方式,实现了与服务的接近,并提供了有保证的QoS。但是,在每个访问节点上保持可操作的边缘服务节点会消耗能源,并且当服务请求处于较低水平时,会增加应用程序提供者的操作费用。在本文中,我们提出了一种算法来选择最合适的接入节点来承载边缘服务节点,并在给定满足业务计算请求所需的服务节点数量和网络拓扑的情况下确定每个服务节点将服务的接入节点集。我们研究了算法在服务延迟和服务节点之间负载平衡方面的行为,在增加计算负载时。通过模拟实验和与穷举搜索算法的比较来进行评估,穷举搜索算法的主要目标是最小化提供给访问节点的服务的延迟。结果验证了所提方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信