Edge Caching Resource Allocation in Fog Radio Access Networks: An Incentive Mechanism Based Approach

2019 IEEE International Conference on Communications Workshops (ICC Workshops)(2019)

引用 3|浏览34
暂无评分
摘要
In this paper, an edge caching resource allocation problem in fog radio access networks (F-RANs) is investigated. To motivate content providers (CPs) to participate in this resource allocation procedure, we introduce an incentive mechanism. By treating fog access points (F-APs) as a specific type of edge caching resource, the cloud server sets non-uniform prices of F-APs and leases them to the CPs, while the CPs cache the most popular contents in the storage of F-APs and get rewarded by the raised content hit rate. We formulate the interaction between the cloud server and the CPs as a Stackelberg game and solve the corresponding optimization problems to achieve Nash equilibrium (NE). In particular, by exploiting the multiplier penalty function method, we transform the constrained optimization problem for the cloud server into an equivalent non-constrained optimization problem. Then, we propose an edge caching resource pricing algorithm to solve the non-constrained optimization problem by applying the simplex search method. We also theoretically prove the existence and uniqueness of the NE. Simulation results show the rapid convergence of the proposed algorithm and the superiority performance in improving content hit rate.
更多
查看译文
关键词
cloud server,nonconstrained optimization problem,edge caching resource pricing algorithm,fog radio access networks,incentive mechanism,edge caching resource allocation problem,content providers,CPs,resource allocation procedure,fog access points,nonuniform prices,constrained optimization problem,content hit rate,Stackelberg game,Nash equilibrium,multiplier penalty function method,simplex search method,superiority performance
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要