M. Merluzzi, P. Lorenzo, S. Barbarossa, V. Frascolla
{"title":"基于MEC的延迟约束动态计算卸载联合资源分配","authors":"M. Merluzzi, P. Lorenzo, S. Barbarossa, V. Frascolla","doi":"10.1109/WCNCW.2019.8902904","DOIUrl":null,"url":null,"abstract":"In this paper, we address the problem of dynamic computation offloading with Multi-Access Edge Computing (MEC), where new requests for computations are continuously generated at each user equipment (UE), and are handled through dynamic queue systems. Building on stochastic optimization tools, we provide a dynamic algorithm that jointly optimize radio (i.e., power, bandwidth) and computation (i.e., CPU cycles) resources, while guaranteeing a target performance in terms of average latency and out of service probability, i.e., the probability that the (sum of) computation queues exceeds a predefined value. The method requires the solution of a convex optimization problem at each time slot, and does not need any apriori knowledge of channel and task arrival distributions. Finally, numerical results corroborate the potential benefits of our strategy.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Joint Resource Allocation for Latency-Constrained Dynamic Computation Offloading with MEC\",\"authors\":\"M. Merluzzi, P. Lorenzo, S. Barbarossa, V. Frascolla\",\"doi\":\"10.1109/WCNCW.2019.8902904\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we address the problem of dynamic computation offloading with Multi-Access Edge Computing (MEC), where new requests for computations are continuously generated at each user equipment (UE), and are handled through dynamic queue systems. Building on stochastic optimization tools, we provide a dynamic algorithm that jointly optimize radio (i.e., power, bandwidth) and computation (i.e., CPU cycles) resources, while guaranteeing a target performance in terms of average latency and out of service probability, i.e., the probability that the (sum of) computation queues exceeds a predefined value. The method requires the solution of a convex optimization problem at each time slot, and does not need any apriori knowledge of channel and task arrival distributions. Finally, numerical results corroborate the potential benefits of our strategy.\",\"PeriodicalId\":121352,\"journal\":{\"name\":\"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNCW.2019.8902904\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNCW.2019.8902904","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Joint Resource Allocation for Latency-Constrained Dynamic Computation Offloading with MEC
In this paper, we address the problem of dynamic computation offloading with Multi-Access Edge Computing (MEC), where new requests for computations are continuously generated at each user equipment (UE), and are handled through dynamic queue systems. Building on stochastic optimization tools, we provide a dynamic algorithm that jointly optimize radio (i.e., power, bandwidth) and computation (i.e., CPU cycles) resources, while guaranteeing a target performance in terms of average latency and out of service probability, i.e., the probability that the (sum of) computation queues exceeds a predefined value. The method requires the solution of a convex optimization problem at each time slot, and does not need any apriori knowledge of channel and task arrival distributions. Finally, numerical results corroborate the potential benefits of our strategy.