服务器
计算机科学
云计算
边缘计算
GSM演进的增强数据速率
分布式计算
最优化问题
延迟(音频)
启发式
装箱问题
数学优化
计算机网络
箱子
操作系统
算法
数学
人工智能
电信
作者
Phu Lai,Qiang He,John Grundy,Feifei Chen,Mohamed Abdelrazek,John Hosking,Yun Yang
出处
期刊:IEEE Transactions on Cloud Computing
[Institute of Electrical and Electronics Engineers]
日期:2020-06-11
卷期号:10 (3): 1701-1713
被引量:72
标识
DOI:10.1109/tcc.2020.3001570
摘要
Edge computing is a new distributed computing paradigm extending the cloud computing paradigm, offering much lower end-to-end latency, as real-time, latency-sensitive applications can now be deployed on edge servers that are much closer to end-users than distant cloud servers. In edge computing, edge user allocation (EUA) is a critical problem for any app vendors, who need to determine which edge servers will serve which users. This is to satisfy application-specific optimization objectives, e.g., maximizing users’ overall quality of experience, minimizing system costs, and so on. In this article, we focus on the cost-effectiveness of user allocation solutions with two optimization objectives. The primary one is to maximize the number of users allocated to edge servers. The secondary one is to minimize the number of required edge servers, which subsequently reduces the operating costs for app vendors. We first model this problem as a bin packing problem and introduce an approach for finding optimal solutions. However, finding optimal solutions to the $\mathcal {NP}$ -hard EUA problem in large-scale scenarios is intractable. Thus, we propose a heuristic to efficiently find sub-optimal solutions to large-scale EUA problems. Extensive experiments conducted on real-world data demonstrate that our heuristic can solve the EUA problem effectively and efficiently, outperforming the state-of-the-art and baseline approaches.
科研通智能强力驱动
Strongly Powered by AbleSci AI