Achieving less than 1 ms end-to-end communication latency, required for certain 5G services and use cases, is imposing severe technical challenges for the deployment of next-generation networks. To achieve such an ambitious goal, the service infrastructure and User Plane Function (UPF) placement at the network edge, is mandatory. However, this solution implies a substantial increase in deployment and operational costs. To cost-effectively solve this joint placement problem, this paper introduces a framework to jointly address the placement of edge nodes (ENs) and UPFs. Our framework proposal relies on Integer Linear Programming (ILP) and heuristic solutions. The main objective is to determine the ENs and UPFs’ optimal number and locations to minimize overall costs while satisfying the service requirements. To this aim, several parameters and factors are considered, such as capacity, latency, costs and site restrictions. The proposed solutions are evaluated based on different metrics and the obtained results showcase over cost savings for the service infrastructure deployment. Moreover, the gap between the UPF placement heuristic and the optimal solution is equal to only one UPF in the worst cases, and a computation time reduction of over is achieved in all the use cases studied.
Edge Computing has grown into a key solution for coping with the stringent latency requirements of 5G scenarios. Nevertheless, the edge node placement problem raises critical concerns regarding deployment and operational expenditures (i.e., mainly due to the number of nodes to be deployed), current backhaul network capabilities, non-technical placement limitations, etc. In this paper, a novel framework called EdgeON is presented aiming at reducing the overall expenses when deploying and operating an Edge Computing (EC) network, taking into account the usage and characteristics of the in-place backhaul network. The framework implements several placement and optimization strategies targeting the heavily constrained network-aware Edge Node Placement Problem (ENPP). The results obtained by our solution are promising, achieving an average of 30% less Edge Nodes (ENs) deployed and 25% higher average usage ratio when compared to other widely used heuristics. Furthermore, our strategy achieved a score offset of less than 2% in comparison to the implemented Mixed Integer Linear Programming (MILP).