posted on 2024-07-11, 15:01authored byPhu Lai, Qiang HeQiang He, John Grundy, Feifei Chen, Mohamed Abdelrazek, John Hosking, Yun YangYun Yang
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 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.
Funding
ARC | DP170101932
ARC | DP180100212
ARC | FL190100035
A Data Driven Paradigm for Service-Oriented System Engineering : Australian Research Council (ARC) | DP180100212
Domain-specific visual languages for big data analytics applications : Australian Research Council (ARC) | DP170101932