Long Term Max-min Fairness Guarantee Mechanism: Adaptive Task Splitting and Resource Allocation in MEC-enabled Networks

  • Jing, Zewei
  • Yang, Qinghai
  • Qin, Meng
  • Kwak, Kyung Sup
Citations

WEB OF SCIENCE

5
Citations

SCOPUS

6

초록

In this paper, we propose an adaptive cross-system resource allocation algorithm while taking into account the long term max-min fairness in the emerging multi-access edge computing (MEC) networks. Specifically, we consider a novel MEC framework which allows smart devices (SDs) to offload their tasks simultaneously to multiple MEC servers through multiple radio access technologies (multi-RATs). In particular, the long term max-min fairness problem is modeled as the stochastic maximization of the minimum time averaged SD utility by jointly considering the SD task splitting, communication and MEC computation resource allocation. To make the formulated problem tractable, we first convert it to a time averaged stochastic maximization problem by an equivalent transformation. Then, an adaptive task splitting and resource allocation algorithm is proposed based on the Lyapunov optimization technique, which makes decisions only according to the current network status and queue state information, without a prior distribution knowledge. Extensive simulations show that the Jain's fairness index of our proposed algorithm can converge to closely 1 quickly and outperforms the traditional sum rate based algorithm.

키워드

multi-access edge computingtask splittingresource allocationmax-min fairness
제목
Long Term Max-min Fairness Guarantee Mechanism: Adaptive Task Splitting and Resource Allocation in MEC-enabled Networks
저자
Jing, ZeweiYang, QinghaiQin, MengKwak, Kyung Sup
DOI
10.1109/pimrcw.2019.8880847
발행일
2019
유형
Proceedings Paper
저널명
2019 IEEE 30TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (IEEE PIMRC WORKSHOPS)