Distance control strategy for deploying content replica servers in an edge cloud  

作　　者：Wei Feng Zou Weixia Wang Zhen Wu Xiaomei 

机构地区：[1]Key Laboratory of Universal Wireless Communications,MOE,Beijing University of Posts and Telecommunications,Beijing 100876,China [2]Slate Key Laboratory of Millimeter Waves,Southeast University,Nanjing 210096,China [3]Department of Communication Engineering,Dalian Neusoft University of Information,Dalian 116023,China [4]Department of Product and Infrastructure of CTTL-systems,China Academy of Information and Communications Technology,Beijing 100088,China

出　　处：《The Journal of China Universities of Posts and Telecommunications》2019年第2期91-98,共8页中国邮电高校学报（英文版）

基　　金：supported by NSFC(61571055);fund of SKL of MMW(K201815);Important National Science and Technology Specific Projects(2017ZX03001028)

摘　　要：To reduce fetching cost from a remote source,it is natural to cache information near the users who may access the information later.However,with development of 5 G ultra-dense cellular networks andmobile edge computing(MEC),a reasonable selection among edge servers for content delivery becomes a problem when the mobile edge obtaining sufficient replica servers.In order to minimize the total cost accounting for both caching and fetching process,we study the optimal resource allocation for the content replica servers’ deployment.We decompose the total cost as the superposition of cost in several coverages.Particularly,we consider the criterion for determining the coverage of a replica server and formulate the coverage as a tradeoff between caching cost and fetching cost.According to the criterion,a coverage isolation(CI) algorithm is proposed to solve the deployment problem.The numerical results show that the proposed CI algorithm can reduce the cost and obtain a higher tolerance for different centrality indices.To reduce fetching cost from a remote source, it is natural to cache information near the users who may access the information later. However, with development of 5G ultra-dense cellular networks andmobile edge computing(MEC), a reasonable selection among edge servers for content delivery becomes a problem when the mobile edge obtaining sufficient replica servers. In order to minimize the total cost accounting for both caching and fetching process, we study the optimal resource allocation for the content replica servers’ deployment. We decompose the total cost as the superposition of cost in several coverages. Particularly, we consider the criterion for determining the coverage of a replica server and formulate the coverage as a tradeoff between caching cost and fetching cost. According to the criterion, a coverage isolation(CI) algorithm is proposed to solve the deployment problem. The numerical results show that the proposed CI algorithm can reduce the cost and obtain a higher tolerance for different centrality indices.

关 键 词：CONTENT delivery network (CDN) MEC REPLICA server DEPLOYMENT minimum cost GREEDY algorithm 

分 类 号：TN[电子电信]