Mobile edge computing is gaining traction due to its ability to deliver ultra-low-latency services for mobile applications. This is achieved through a federation of edge clouds in close proximity of users. However, the intrinsic mobility of users brings a high level of dynamics to the edge environment, calling for sophisticated service migration management across the edge clouds. Previous solutions for edge service placement/migration are architecture-specific, centralized, or are based on restricted cost models. These limitations leave doubts about the practicality of these approaches due to the lack of a standardized reference model for edge clouds. In this paper, we propose a general framework for optimizing edge service migration based on reinforcement learning techniques. Using our framework, edge service migration strategies can be learned with respect to a large variety of optimization goals. Moreover, our learning-based algorithm is agnostic to the underlying architecture and resource constraints. Preliminary results show that our model-free learning-based approach can compete with model-based baselines and adapt to different objectives.
{"title":"A Learning-based Framework for Optimizing Service Migration in Mobile Edge Clouds","authors":"Florian Brandherm, L. Wang, M. Mühlhäuser","doi":"10.1145/3301418.3313939","DOIUrl":"https://doi.org/10.1145/3301418.3313939","url":null,"abstract":"Mobile edge computing is gaining traction due to its ability to deliver ultra-low-latency services for mobile applications. This is achieved through a federation of edge clouds in close proximity of users. However, the intrinsic mobility of users brings a high level of dynamics to the edge environment, calling for sophisticated service migration management across the edge clouds. Previous solutions for edge service placement/migration are architecture-specific, centralized, or are based on restricted cost models. These limitations leave doubts about the practicality of these approaches due to the lack of a standardized reference model for edge clouds. In this paper, we propose a general framework for optimizing edge service migration based on reinforcement learning techniques. Using our framework, edge service migration strategies can be learned with respect to a large variety of optimization goals. Moreover, our learning-based algorithm is agnostic to the underlying architecture and resource constraints. Preliminary results show that our model-free learning-based approach can compete with model-based baselines and adapt to different objectives.","PeriodicalId":131097,"journal":{"name":"Proceedings of the 2nd International Workshop on Edge Systems, Analytics and Networking","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123234467","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Proceedings of the 2nd International Workshop on Edge Systems, Analytics and Networking","authors":"","doi":"10.1145/3301418","DOIUrl":"https://doi.org/10.1145/3301418","url":null,"abstract":"","PeriodicalId":131097,"journal":{"name":"Proceedings of the 2nd International Workshop on Edge Systems, Analytics and Networking","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133223449","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：