Distributed Algorithm for Computation Offloading in Mobile Edge Computing

User mobility is an intrinsic trait of many MEC applications, which has posed significant challenges for realizing reliable computing. However, existing works studying this problem mainly focus on the movements of users while another high-dynamic behavior due to the randomness of computation tasks is largely ignored. To fill this gap, in this paper, we formulate the computation offloading problem in MEC system as a combinatorial optimization problem, and then we construct a Markov chain with steady-state distribution specifying to our problem in a distributed manner, such that the user mobility problem is transformed into the state transition problem. Moreover, this Markov chain is further extended to consider a dynamic scenario where the number of active users in the MEC system changes over time. Numerical results show that our proposed algorithm can converge very fast to the optimal solution, and has a provable performance with a guaranteed loss bound.