Ricerc@Sapienza

This paper presents an original discrete-time, distributed, noncooperative load-balancing algorithm, based on mean field game theory, which does not require explicit communications. The algorithm is proven to converge to an arbitrarily small neighborhood of a specific equilibrium among the loads of the providers, known as Wardrop equilibrium.

Power-of-random choices is a well-known phenomenon exploited in load balancing algorithms to achieve an extraordinary improvement at low cost. These algorithms are particularly suitable for the Fog computing model, since they don't require coordination among different fog nodes when they decide to mutually share their resources. In this paper, we propose LL(F, T ) a power-of-random choices based distributed peer-to-peer load balancing algorithm running on a set of autonomous cooperating fog nodes, where F is the protocol fan-out and T a threshold.