{"title":"HyEdge:用于提供私有和公共服务的协作边缘计算框架","authors":"Siyuan Gu, Deke Guo, Guoming Tang, Lailong Luo, Yuchen Sun, Xueshan Luo","doi":"10.1145/3585078","DOIUrl":null,"url":null,"abstract":"With the widespread use of Internet of Things (IoT) devices and the arrival of the 5G era, edge computing has become an attractive paradigm to serve end-users and provide better QoS. Many efforts have been paid to provision some merging public network services at the network edge. We reveal that it is very common that specific users call for private and isolated edge services to preserve data privacy and enable other security intentions. However, it still remains open to fulfill such kind of mixed requests in edge computing. In this article, we propose a cooperative edge computing framework, i.e., HyEdge, to offer both public and private edge services systematically. To fully exploit the benefits of this novel framework, we define the problem of optimal request scheduling over a given placement solution of hybrid edge servers to minimize the response delay. This problem is further modeled as a mixed integer non-linear programming problem (MINLP), which is typically NP-hard. Accordingly, we propose the partition-based optimization method, which can efficiently solve this NP-hard problem via the problem decomposition and the branch and bound strategies. We finally conduct extensive evaluations with a real-world dataset to measure the performance of our method. The results indicate that the proposed method achieves elegant performance with low computation complexity.","PeriodicalId":29764,"journal":{"name":"ACM Transactions on Internet of Things","volume":"24 1","pages":"1 - 23"},"PeriodicalIF":3.5000,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"HyEdge: A Cooperative Edge Computing Framework for Provisioning Private and Public Services\",\"authors\":\"Siyuan Gu, Deke Guo, Guoming Tang, Lailong Luo, Yuchen Sun, Xueshan Luo\",\"doi\":\"10.1145/3585078\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the widespread use of Internet of Things (IoT) devices and the arrival of the 5G era, edge computing has become an attractive paradigm to serve end-users and provide better QoS. Many efforts have been paid to provision some merging public network services at the network edge. We reveal that it is very common that specific users call for private and isolated edge services to preserve data privacy and enable other security intentions. However, it still remains open to fulfill such kind of mixed requests in edge computing. In this article, we propose a cooperative edge computing framework, i.e., HyEdge, to offer both public and private edge services systematically. To fully exploit the benefits of this novel framework, we define the problem of optimal request scheduling over a given placement solution of hybrid edge servers to minimize the response delay. This problem is further modeled as a mixed integer non-linear programming problem (MINLP), which is typically NP-hard. Accordingly, we propose the partition-based optimization method, which can efficiently solve this NP-hard problem via the problem decomposition and the branch and bound strategies. We finally conduct extensive evaluations with a real-world dataset to measure the performance of our method. The results indicate that the proposed method achieves elegant performance with low computation complexity.\",\"PeriodicalId\":29764,\"journal\":{\"name\":\"ACM Transactions on Internet of Things\",\"volume\":\"24 1\",\"pages\":\"1 - 23\"},\"PeriodicalIF\":3.5000,\"publicationDate\":\"2023-03-13\",\"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/3585078\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Internet of Things","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3585078","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
HyEdge: A Cooperative Edge Computing Framework for Provisioning Private and Public Services
With the widespread use of Internet of Things (IoT) devices and the arrival of the 5G era, edge computing has become an attractive paradigm to serve end-users and provide better QoS. Many efforts have been paid to provision some merging public network services at the network edge. We reveal that it is very common that specific users call for private and isolated edge services to preserve data privacy and enable other security intentions. However, it still remains open to fulfill such kind of mixed requests in edge computing. In this article, we propose a cooperative edge computing framework, i.e., HyEdge, to offer both public and private edge services systematically. To fully exploit the benefits of this novel framework, we define the problem of optimal request scheduling over a given placement solution of hybrid edge servers to minimize the response delay. This problem is further modeled as a mixed integer non-linear programming problem (MINLP), which is typically NP-hard. Accordingly, we propose the partition-based optimization method, which can efficiently solve this NP-hard problem via the problem decomposition and the branch and bound strategies. We finally conduct extensive evaluations with a real-world dataset to measure the performance of our method. The results indicate that the proposed method achieves elegant performance with low computation complexity.