Matryoshka: Joint Resource Scheduling for Cost-Efficient MEC in NGFI-Based C-RAN

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

引用 2|浏览33
暂无评分
摘要
In this paper, we consider MEC in NGFI-based C-RAN, a novel and practical MEC framework to facilitate the emerging mobile applications such as AR/VR and video surveillance. However, it is challenging to implement it in a cost-efficient manner (i.e., optimized operational expenditures and service performance), due to the coupled resource provision, service deployment and workload distribution. To solve this joint resource scheduling problem, we resort to rounding and decomposition to devise Matryoshka, a novel approximation algorithm with polynomial running time. Extensive data-driven simulations corroborate that Matryoshka achieves superior performance (e.g., 43% and 52% performance gain compared with two state-of-the-art works, CSPP and Octopus) and scales well to support a variety of system settings.
更多
查看译文
关键词
coupled resource provision,service deployment,workload distribution,joint resource scheduling problem,Matryoshka,NGFI-based C-RAN,video surveillance,optimized operational expenditures,MEC framework,mobile applications,AR-VR surveillance,approximation algorithm,polynomial running time,CSPP
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要