Collaborative Resource Management and Workloads Scheduling in Cloud-Assisted Mobile Edge Computing across Timescales

TL;DR

This paper presents RMWS, a two-timescale framework for optimizing resource management and workload scheduling in cloud-assisted mobile edge computing, significantly improving system performance while reducing costs and instability.

Contribution

It introduces a novel two-timescale approach combining algorithms for service placement, resource provisioning, and workload scheduling in IoT edge computing environments.

Findings

RMWS achieves at least 10% performance improvement over existing algorithms.

The framework effectively balances cost, stability, and performance in resource-constrained edge settings.

Theoretical proofs validate the optimality and convergence of the proposed algorithms.

Abstract

Due to the limited resource capacity of edge servers and the high purchase costs of edge resources, service providers are facing the new challenge of how to take full advantage of the constrained edge resources for Internet of Things (IoT) service hosting and task scheduling to maximize system performance. In this paper, we study the joint optimization problem on service placement, resource provisioning, and workloads scheduling under resource and budget constraints, which is formulated as a mixed integer non-linear programming problem. Given that the frequent service placement and resource provisioning will significantly increase system configuration costs and instability, we propose a two-timescale framework for resource management and workloads scheduling, named RMWS. RMWS consists of a Gibbs sampling algorithm and an alternating minimization algorithm to determine the service placement and resource provisioning on large timescales. And a sub-gradient descent method has been designed to solve the workload scheduling challenge on small timescales.We conduct comprehensive experiments under different parameter settings. The RMWS consistently ensures a minimum 10% performance enhancement compared to other algorithms, showcasing its superiority. Theoretical proofs are also provided accordingly.