Server deployment is a fundamental task in mobile edge computing: where to place the edge servers and what user cells to assign to them. To make this decision is context-specific, but common goals are 1) computing efficiency: maximize the amount of workload processed by the edge, and 2) communication efficiency: minimize the communication cost between the cells and their assigned servers. We focus on practical scenarios where the user workload in each cell is unknown and time-varying, and so are the effective capacities of the servers. Our research problem is to choose a subset of candidate servers and assign them to the user cells such that the above goals are sustainably achieved under the above uncertainties. We formulate this problem as a stochastic bilevel optimization, which is strongly NP-hard and unseen in the literature. By approximating the objective function with submodular functions, we can utilize state-of-the-art greedy algorithms for submodular maximization to effectively solve our problem. We evaluate the proposed algorithm using real-world data, showing its superiority to alternative methods; the improvement can be as high as 55%
翻译:服务器部署是移动边缘计算中的一项基础任务:确定边缘服务器的部署位置以及将哪些用户单元分配给它们。这一决策需结合具体情境,但通常目标包括:1) 计算效率:最大化边缘处理的工作负载量;2) 通信效率:最小化用户单元与其分配服务器之间的通信成本。我们关注实际场景中每个用户单元的工作负载未知且时变,服务器有效容量同样动态变化的情况。我们的研究问题在于选择候选服务器子集并将其分配给用户单元,以确保在上述不确定性下可持续实现上述目标。我们将该问题建模为随机双层优化问题,该问题属于强NP难问题,且现有文献尚未涉及。通过使用子模函数近似目标函数,我们能够利用最先进的子模最大化贪心算法有效求解该问题。基于真实世界数据的评估表明,所提算法优于现有替代方法,性能提升最高可达55%。