Service Function Chaining in MEC: A Mean-Field Game and Reinforcement Learning Approach

Multiaccess edge computing (MEC) and network virtualization technologies are important enablers for fifth generation networks to deliver diverse services. Services are often provided as fully connected virtual network functions (VNFs), through service function chaining (SFC). However, the problem of allocating SFC resources at the edge still faces many challenges related to the way VNFs are placed, chained, and scheduled. In this article, to solve these problems, we propose a game theory-based approach with the objective to reduce service latency in the context of SFC at the edge. The problem of allocating SFC resources can be divided into two subproblems: 1) the VNF placement and routing subproblem, and 2) the VNF scheduling subproblem. For the former subproblem, we formulate it as a mean-field game in which VNFs are contending over edge resources aiming at reducing the resource consumption of MEC nodes and reducing latency for users. We also propose a reinforcement learning-based technique, where the Ishikawa–Mann learning algorithm is used. For the later subproblem, we formulate it as a matching game between VFNs and edge resources to find the execution order of the VNFs while reducing the latency. To efficiently solve it, we propose a modified version of the many-to-one deferred acceptance algorithm (DAA), called the enhanced multistep DAA. To illustrate the performance of the proposed approaches, we perform extensive simulations. The results show that the approaches achieve up to 40% less resource consumption, and up to 38% less latency than the benchmarked state-of-the-art methods. IEEE