Research Area: Edge Computing
The evolution of wireless and hardware technology has led to the rapid development of a variety of mobile applications. Common to these applications is that they have low latency and high computational requirements that often cannot be fulfilled by individual devices due to their insufficient computational power, memory and battery capacity. An emerging approach to meet increasing user demand for delay sensitive and computationally intensive applications is mobile edge computing. The core paradigm of mobile edge computing is to bring computing and storage resources close to the end users and by doing so to relieve devices from computationally heavy workloads while meeting delay requirements of applications. However, the overall performance of edge computing systems is determined by the efficiency of the joint allocation of wireless and computing resources. The work in this thesis proposes decentralized algorithms for allocating these two resources in edge computing infrastructures.In the first part of the thesis, we consider the resource allocation and computational task scheduling problem in an edge computing system in which wireless devices can use cloud resources and the resources of each other with the objective to minimize their own perceived response times.
we propose a polynomial complexity decentralized algorithm and characterize the structure of equilibria computed by the algorithm.In the third part of the thesis, we consider the joint resource allocation and computational task assignment problem in an edge computing system that consists of multiple edge clouds and wireless links managed by a single network operator. We model the interaction between the operator and devices that aim at minimizing their response times as a Stackel berg game. We expresst he optimal resource allocation policies in closed form, prove the existence of Stackelberg equilibria and propose an efficient decentralized algorithm with abounded approximation ratio. Finally, we consider the same edge computing system under network slicing, and based on a game theoretic treatment of the problem we develop an approximation algorithm for assigning tasks to slices and managing the resources across and within slices.By providing constructive equilibrium existence proofs, the results in this thesis provide low complexity decentralized algorithms for allocating edge computing resources in a variety of edge computing infrastructures.
Name of the Researcher: Josilo, Sladana
Name of the Supervisor(s): Dán, György
Year of Completion: 2020
University: KTH Royal Institute of Technology
Thesis Link: Home Page Url
