Delay-Aware Multi-Stage Edge Server Upgrade with Budget Constraint
Endar Suprih Wihidayat, Sieteng Soh, Kwan-Wu Chin, Duc-son Pham
TL;DR
This work introduces the Multi-stage Edge Server Upgrade (M-ESU) problem, addressing long-term MEC network planning under per-stage budgets by upgrading existing edge servers or deploying new ones to maximize the number of tasks meeting their delay requirements. It proposes a MILP formulation for optimality in small networks and a scalable heuristic, M-ESU/H, that achieves near-optimal results with significantly reduced computation time in large networks. The framework accounts for task growth and evolving delay constraints, includes a fractional offloading mechanism, and models depreciation of deployment costs over time. Extensive evaluation shows M-ESU/H outperforming several baselines in task satisfaction and resource efficiency, with demand prediction further boosting robustness and performance in multi-stage planning.
Abstract
In this paper, the Multi-stage Edge Server Upgrade (M-ESU) is proposed as a new network planning problem, involving the upgrading of an existing multi-access edge computing (MEC) system through multiple stages (e.g., over several years). More precisely, the problem considers two key decisions: (i) whether to deploy additional edge servers or upgrade those already installed, and (ii) how tasks should be offloaded so that the average number of tasks that meet their delay requirement is maximized. The framework specifically involves: (i) deployment of new servers combined with capacity upgrades for existing servers, and (ii) the optimal task offloading to maximize the average number of tasks with a delay requirement. It also considers the following constraints: (i) budget per stage, (ii) server deployment and upgrade cost (in $) and cost depreciation rate, (iii) computation resource of servers, (iv) number of tasks and their growth rate (in %), and (v) the increase in task sizes and stricter delay requirements over time. We present two solutions: a Mixed Integer Linear Programming (MILP) model and an efficient heuristic algorithm (M-ESU/H). MILP yields the optimal solution for small networks, whereas M-ESU/H is used in large-scale networks. For small networks, the simulation results show that the solution computed by M-ESU/H is within 1.25% of the optimal solution while running several orders of magnitude faster. For large networks, M-ESU/H is compared against three alternative heuristic solutions that consider only server deployment, or giving priority to server deployment or upgrade. Our experiments show that M-ESU/H yields up to 21.57% improvement in task satisfaction under identical budget and demand growth conditions, confirming its scalability and practical value for long-term MEC systems.