Journal
IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2021)
Volume -, Issue -, Pages -Publisher
IEEE
DOI: 10.1109/ICC42927.2021.9500537
Keywords
Mobile edge computing; Scheduling; Game theory
Categories
Ask authors/readers for more resources
The study proposes a distributed edge computing server task scheduling model based on game theory, which can achieve a balance between link quality and computing resources and provide different quality of service for users of different priorities. By using acceleration methods, the Nash equilibrium can be reached faster.
Task scheduling on edge computing servers is an important issue that affects user experience. Existing scheduling methods require centralized control to achieve the best overall performance. However, it is impractical to force all users to act according to centralized control. We propose a distributed edge computing server task scheduling model based on game theory. Our method comprehensively considers the link quality from the mobile device to the server and the server's computing resource allocation when selecting edge computing servers, and achieves a balance between link quality and computing resources. Once the Nash equilibrium is reached, our model can provide different QoS for users of different priorities. Acceleration methods are proposed to achieve the Nash equilibrium faster. The simulation results show that the proposed model can provide differentiated services while optimizing the scheduling of computing resources, and ensure that the algorithm achieves an approximate Nash equilibrium in polynomial time.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available