Matching-Game for User-Fog Assignment

TL;DR

This paper introduces a matching game approach with a multi-stage algorithm to optimize user-to-fog assignment in fog computing, reducing delays and balancing resource use at the network edge.

Contribution

It formulates user-fog association as a matching game with quota constraints and proposes a Multi-Stage Differed Acceptance algorithm for improved resource balancing and response times.

Findings

Achieves lower user delays compared to baseline methods.

Balances fog resource utilization effectively.

Improves response times in fog computing environments.

Abstract

Fog computing has emerged as a new paradigm in mobile network communications, aiming to equip the edge of the network with the computing and storing capabilities to deal with the huge amount of data and processing needs generated by the users' devices and sensors. Optimizing the assignment of users to fogs is, however, still an open issue. In this paper, we formulated the problem of users-fogs association, as a matching game with minimum and maximum quota constraints, and proposed a Multi-Stage Differed Acceptance (MSDA) in order to balance the use of fogs resources and offer a better response time for users. Simulations results show that the performance of the proposed model compared to a baseline matching of users, achieves lowers delays for users.