Abstract
Mobile edge computing is a promising paradigm that provides edge users with dependable computing services. However, due to the dynamic nature of mobile users and the limited resources of edge servers, it is essential to emphasize the load balancing of edge servers and the cooperation of heterogeneous computing resources. This paper proposes a Dynamic Resource Allocation (DRA) scheme based on a Quantum Approximate Optimization Algorithm (QAOA). The DRA is composed of the two components listed below. Firstly, we apply generative adversarial network to predict the future user density in various regions, which is an effective resource allocation aid. Secondly, QAOA is utilized to pre-allocate edge servers resources based on an advanced model of user density. The simulation results demonstrate that the efficient application of DRA ensures the load balancing of edge servers and simultaneously alleviates communication latency.
Similar content being viewed by others
Availability of data and materials
All data, models, and code generated and used during the current study are available from the corresponding author on reasonable request.
References
Tang F, Fadlullah ZM, Mao B, Kato N (2018) An intelligent traffic load prediction-based adaptive channel assignment algorithm in SDN-IoT: a deep learning approach. IEEE Internet Things J 5(6):5141–5154. https://doi.org/10.1109/JIOT.2018.2838574
Rago A, Piro G, Boggia G, Dini P (2021) Anticipatory allocation of communication and computational resources at the edge using spatio-temporal dynamics of mobile users. IEEE Trans Netw Serv Manage 18(4):4548–4562. https://doi.org/10.1109/TNSM.2021.3099472
Liang Z, Liu Y, Lok T-M, Huang K (2021) Multi-cell mobile edge computing: joint service migration and resource allocation. IEEE Trans Wireless Commun 20(9):5898–5912. https://doi.org/10.1109/TWC.2021.3070974
Liang L, Xiao J, Ren Z, Chen Z, Jia Y (2020) Particle swarm based service migration scheme in the edge computing environment. IEEE Access 8:45596–45606. https://doi.org/10.1109/ACCESS.2020.2978093
Xu M, Zhou Q, Wu H, Lin W, Ye K, Xu C (2022) Pdma: probabilistic service migration approach for delay-aware and mobility-aware mobile edge computing. Softw Pract Exp 52(2):394–414
Chen X, Bi Y, Chen X, Zhao H, Cheng N, Li F, Cheng W (2022) Dynamic service migration and request routing for microservice in multicell mobile-edge computing. IEEE Internet Things J 9(15):13126–13143. https://doi.org/10.1109/JIOT.2022.3140183
Park J, Lim Y (2021) Balancing loads among MEC servers by task redirection to enhance the resource efficiency of MEC systems. Appl Sci 11(16):7589. https://doi.org/10.3390/app11167589
Zhang F, Wang MM (2021) Stochastic congestion game for load balancing in mobile-edge computing. IEEE Internet Things J 8(2):778–790. https://doi.org/10.1109/JIOT.2020.3008009
Inderjeet K, Lydia Kumar NV, Bhanu S, Jamel N, Sharaf M (2022) Generative adversarial networks with quantum optimization model for mobile edge computing in IoT big data. Wireless Pers Commun 127:1–21. https://doi.org/10.1007/s11277-021-08706-7
Xu Z, Wang S, Liu S, Dai H, Xia Q, Liang W, Wu G (2020) Learning for exception: dynamic service caching in 5g-enabled MECS with bursty user demands. In: 2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS), pp 1079–1089. https://doi.org/10.1109/ICDCS47774.2020.00098
Etesami SR (2020) Complexity and approximability of optimal resource allocation and Nash equilibrium over networks. SIAM J Optim 30(1):885–914. https://doi.org/10.1137/19M1242525
Qian LP, Feng A, Huang Y, Wu Y, Ji B, Shi Z (2019) Optimal sic ordering and computation resource allocation in MEC-aware NOMA NB-IoT networks. IEEE Internet Things J 6(2):2806–2816. https://doi.org/10.1109/JIOT.2018.2875046
Fang F, Wang K, Ding Z, Leung VCM (2021) Energy-efficient resource allocation for NOMA-MEC networks with imperfect CSI. IEEE Trans Commun 69(5):3436–3449. https://doi.org/10.1109/TCOMM.2021.3058964
Farhi E, Goldstone J, Gutmann S (2014) A quantum approximate optimization algorithm. Eprint Arxiv
Azad U, Behera BK, Ahmed EA, Panigrahi PK, Farouk A (2022) Solving vehicle routing problem using quantum approximate optimization algorithm. IEEE Trans Intell Transp Syst. https://doi.org/10.1109/TITS.2022.3172241
Vikstl P, Grnkvist M, Svensson M, Andersson M, Ferrini G (2020) Applying the quantum approximate optimization algorithm to the tail-assignment problem. Phys Rev Appl 14(3):034009
Fernandez-Pendas M, Combarro EF, Vallecorsa S, Ranilla J, Rua IF (2021) A study of the performance of classical minimizers in the quantum approximate optimization algorithm - sciencedirect. J Comput Appl Math 404:113388
Ruan Y, Marsh S, Xue X, Liu Z, Wang J (2020) The quantum approximate algorithm for solving traveling salesman problem. CMC-Comput Mater Cont 63(3):1237–1247. https://doi.org/10.32604/cmc.2020.01000
Kosaraju V, Sadeghian A, Martín-Martín R, Reid I, Rezatofighi SH, Savarese S (2019) Social-BiGAT: Multimodal Trajectory Forecasting Using Bicycle-GAN and Graph Attention Networks. Curran Associates Inc., USA
Zhao L, Liu Y, Al-Dubai AY, Zomaya AY, Min G, Hawbani A (2021) A novel generation-adversarial-network-based vehicle trajectory prediction method for intelligent vehicular networks. IEEE Internet Things J 8(3):2066–2077. https://doi.org/10.1109/JIOT.2020.3021141
Pang SM, Cao JX, Jian MY, Lai J, Yan ZY (2022) Br-Gan: a pedestrian trajectory prediction model combined with behavior recognition. IEEE Trans Intell Transp Syst 23(12):24609–24620. https://doi.org/10.1109/TITS.2022.3193442
Papageorgiou A, Petras I (2014) Estimating the ground state energy of the schrödinger equation for convex potentials. J Complex 30(4):469–494. https://doi.org/10.1016/j.jco.2014.03.002
Lucas A (2014) Ising formulations of many NP problems. Front Phys 2:5. https://doi.org/10.3389/fphy.2014.00005
Breeze B, Jollymore G (2017) Understanding solicitation: beyond the binary variable of being asked or not being asked. Int J Nonprofit Volunt Sector Market 22(4):1607. https://doi.org/10.1002/nvsm.1607
Funding
This work is funded by the Liaoning Provincial Department of Education Research under Grant LJKZ0208, the Scientific Research Foundation for Advanced Talents from Shenyang Aerospace University 18YB06, and National Basic Research Program of China JCKY2018410C004.
Author information
Authors and Affiliations
Contributions
All authors have created and read the manuscript.
Corresponding author
Ethics declarations
Conflicts of interest
The authors declare no competing interests.
Ethical Approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Gong, C., He, W., Wang, T. et al. Dynamic resource allocation scheme for mobile edge computing. J Supercomput 79, 17187–17207 (2023). https://doi.org/10.1007/s11227-023-05323-y
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-023-05323-y