{"title":"移动边缘计算网络中服务器布局和内容缓存的联合优化","authors":"Zhen Liu, Jiawei Zhang, Jingyan Wu","doi":"10.1145/3375998.3376024","DOIUrl":null,"url":null,"abstract":"To address the severe challenge from the rapid growth of number of downloads of contents via mobile network, it is imperative to develop efficient content caching scheme in mobile edge computing (MEC) networks, which can alleviate the heavy burden on backhaul links and reduce the delay for content delivery. However, the caching performance is highly related to the MEC server placement. In this paper, we jointly optimize the server placement problem and content caching problem in MEC networks. We propose a heuristic algorithm based on Kuhn-Munkres (KM) algorithm and greedy algorithm to minimize the average delay and average bandwidth resource usage. The simulation shows that our proposed algorithm can reduce delay and bandwidth, compared with other schemes.","PeriodicalId":395773,"journal":{"name":"Proceedings of the 2019 8th International Conference on Networks, Communication and Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Joint Optimization of Server Placement and Content Caching in Mobile Edge Computing Networks\",\"authors\":\"Zhen Liu, Jiawei Zhang, Jingyan Wu\",\"doi\":\"10.1145/3375998.3376024\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To address the severe challenge from the rapid growth of number of downloads of contents via mobile network, it is imperative to develop efficient content caching scheme in mobile edge computing (MEC) networks, which can alleviate the heavy burden on backhaul links and reduce the delay for content delivery. However, the caching performance is highly related to the MEC server placement. In this paper, we jointly optimize the server placement problem and content caching problem in MEC networks. We propose a heuristic algorithm based on Kuhn-Munkres (KM) algorithm and greedy algorithm to minimize the average delay and average bandwidth resource usage. The simulation shows that our proposed algorithm can reduce delay and bandwidth, compared with other schemes.\",\"PeriodicalId\":395773,\"journal\":{\"name\":\"Proceedings of the 2019 8th International Conference on Networks, Communication and Computing\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2019 8th International Conference on Networks, Communication and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3375998.3376024\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 8th International Conference on Networks, Communication and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3375998.3376024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Joint Optimization of Server Placement and Content Caching in Mobile Edge Computing Networks
To address the severe challenge from the rapid growth of number of downloads of contents via mobile network, it is imperative to develop efficient content caching scheme in mobile edge computing (MEC) networks, which can alleviate the heavy burden on backhaul links and reduce the delay for content delivery. However, the caching performance is highly related to the MEC server placement. In this paper, we jointly optimize the server placement problem and content caching problem in MEC networks. We propose a heuristic algorithm based on Kuhn-Munkres (KM) algorithm and greedy algorithm to minimize the average delay and average bandwidth resource usage. The simulation shows that our proposed algorithm can reduce delay and bandwidth, compared with other schemes.