Edge Server Selection with Round-Robin-Based Task Processing in Multiserver Mobile Edge Computing

Mobile edge computing was conceived to address the increasing computing demand generated by users at the communication network edge. It is expected to play a significant role in next-generation (5G, 6G, and beyond) communication systems as new applications such as augmented/extended reality, teleoperations, telemedicine, and gaming become prolific. As the networks become denser, more and more edge servers are expected to be deployed, and the question of task offloading becomes more complicated. In this study, we present a framework for task offloading in the presence of multiple edge servers that employ round-robin task scheduling. Most studies in the literature attempt to optimize the offloading process under the assumption that each user generates just a single task, or they generate one task every time slot in a discrete-time system where all the tasks are handled within a slot. Furthermore, first-come-first-served queueing models are typically used in studies where queueing is considered at all. The work presented is novel in that we assume continuous and stochastic task arrivals generated by multiple users and round-robin task scheduling at the edge servers. This setting is considerably more realistic with respect to the existing works, and we demonstrate through extensive simulations that round-robin task scheduling significantly reduces task delay. We also present a comparison of a number of server selection mechanisms.