ITITMay 23

Joint Service Placement and Resource Optimization in Hierarchical Edge-Cloud Networks

arXiv:2605.246416.3
Predicted impact top 89% in IT · last 90 daysOriginality Incremental advance
AI Analysis

For network operators managing hierarchical edge-cloud systems, this work provides a joint optimization framework that improves latency and cost efficiency, though the approach is incremental as it combines existing techniques.

This paper jointly optimizes service placement, edge/cloud cooperation, task offloading, and bandwidth allocation in hierarchical edge-cloud IoT networks to minimize end-to-end latency and system cost. The proposed iterative algorithms, based on relaxation and successive convex approximation, converge to a local optimum and outperform benchmark schemes in numerical simulations.

Hierarchical edge-cloud computing-aided Internet of Things (IoT) networks offer low-latency and cost-efficient services to a growing number of data-intensive IoT devices. However, optimizing service placement, which involves determining the most suitable locations within a network to deploy various services, is critical to balancing workloads dynamically and ensuring efficient resource utilization. In this paper, we jointly optimize service placement, edge/cloud cooperation, task offloading, and bandwidth allocation to enhance processing efficiency and response times. The main objective is to minimize both the overall end-to-end latency and the system cost, including service deployment and operational costs. The formulated problem belongs to the class of non-convex mixed-integer nonlinear programming, where finding a feasible solution is already challenging. Towards a stable system, we first transform the original problem into a more tractable form and then decompose it into sub-problems which are solved at different timescales. Combining tools from relaxation and the successive convex approximation method, we develop iterative algorithms to solve these problems efficiently. With an appropriate penalty parameter, the proposed algorithms guarantee convergence to at least a local optimum. We produce extensive numerical results to demonstrate the superior performance of the proposed algorithms over benchmark schemes as well as emphasize the significance of the joint service placement and resource allocation in enhancing system performance and efficiency.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes