Abstract
Prompted by the remarkable progress in mobile edge computing, there is an increasing need for executing complex applications on the edge server. These complex applications can be described using workflows which is a set of interdependent tasks. Existing studies focus on offloading the workflow tasks to the nearby edge servers in order to achieve high quality of service, However, the original edge server with the offloaded workflow tasks may be far away from the users due to the high mobility of users in mobile edge computing (MEC). Therefore, it is a key challenge to make good decisions on where and when the workflow tasks are migrated in the light of user’s mobility. In this paper, we propose a workflow task migration algorithm based on deep reinforcement learning with the goal of optimizing the cost of workflow migration under delay-guarantee constraints. The proposed algorithm firstly utilizes the Recurrent Neural Network (RNN) based model to predict the mobile location of users, and then applies a dynamic programming algorithm to calculate the completion time of workflow. Finally, an improved Deep Q Network (DQN) algorithm is adopted to find the optimal workflow migration strategy. In order to assess the performance of the proposed algorithm, extensive simulations are carried out for four well-known scientific workflows. The experimental results show that the proposed algorithm can meet threshold at lower costs in comparison with the state-of-the-art approaches applied to similar problems.
Supported in part by the National Natural Science Foundation of China under Grant 61662052, in part by the Natural Science Foundation of Inner Mongolia Autonomous Region under Grant 2021MS06002, in part by he Science and Technology Planning Project of Inner Mongolia Autonomous Region under Grant 2021GG0155, and in part by the Major Research Plan of Inner Mongolia Natural Science Foundation under Grant 2019ZD15.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Mao, Y., You, C., Zhang, J., Huang, K., Letaief, K.B.: A survey on mobile edge computing: the communication perspective. IEEE Commun. Surv. Tut. 19(4), 2322–2358 (2017)
Adhikari, M., Amgoth, T., Srirama, S.N.: A survey on scheduling strategies for workflows in cloud environment and emerging trends. ACM Comput. Surv. (CSUR) 52(4), 1–36 (2019)
Masdari, M., Zangakani, M.: Efficient task and workflow scheduling in inter-cloud environments: challenges and opportunities. J. Supercomput. 76(1), 499–535 (2019). https://doi.org/10.1007/s11227-019-03038-7
Ouyang, T., Zhou, Z., Chen, X.: Follow me at the edge: mobility-aware dynamic service placement for mobile edge computing. IEEE J. Sel. Areas Commun. 36(10), 2333–2345 (2018)
You, C., Huang, K., Chae, H., Kim, B.-H.: Energy-efficient resource allocation for mobile-edge computation offloading. IEEE Trans. Wirel. Commun. 16(3), 1397–1411 (2016)
Heydari, J., Ganapathy, V., Shah, M.: Dynamic task offloading in multi-agent mobile edge computing networks. In: 2019 IEEE Global Communications Conference (GLOBECOM), pp. 1–6. IEEE (2019)
Mazouzi, H., Achir, N., Boussetta, K.: Elastic offloading of multitasking applications to mobile edge computing. In: Proceedings of the 22nd International ACM Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pp. 307–314 (2019)
Peng, K., et al.: An energy-and cost-aware computation offloading method for workflow applications in mobile edge computing. EURASIP J. Wirel. Commun. Netw. 2019(1), 1–15 (2019)
Wang, S., Urgaonkar, R., Zafer, M., He, T., Chan, K., Leung, K.K.: Dynamic service migration in mobile edge computing based on Markov decision process. IEEE/ACM Trans. Netw. 27(3), 1272–1288 (2019)
Zhang, C., Zheng, Z.: Task migration for mobile edge computing using deep reinforcement learning. Fut. Gener. Comput. Syst. 96, 111–118 (2019)
Dinh, T.Q., Tang, J., La, Q.D., Quek, T.Q.S.: Offloading in mobile edge computing: task allocation and computational frequency scaling. IEEE Trans. Commun. 65(8), 3571–3584 (2017)
Liu, J., Mao, Y., Zhang, J., Letaief, K.B.: Delay-optimal computation task scheduling for mobile-edge computing systems. In: 2016 IEEE International Symposium on Information Theory (ISIT), pp. 1451–1455. IEEE (2016)
Pellegrini, S., Ess, A., Schindler, K., Van Gool, L.: You’ll never walk alone: modeling social behavior for multi-target tracking. In: 2009 IEEE 12th International Conference on Computer Vision, pp. 261–268. IEEE (2009)
Lerner, A., Chrysanthou, Y., Lischinski, D.: Crowds by example. In: Computer Graphics Forum, pp. 655–664. Wiley Online Library (2007)
Bharathi, S., Chervenak, A., Deelman, E., Mehta, G., Su, M.-H., Vahi, K.: Characterization of scientific workflows. In: 2008 3rd Workshop on Workflows in Support of Large-Scale Science, pp. 1–10. IEEE (2008)
Gupta, A., Johnson, J., Fei-Fei, L., Savarese, S., Alahi, A.: Social GAN: socially acceptable trajectories with generative adversarial networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2255–2264 (2018)
Trautman, P., Ma, J., Murray, R.M., Krause, A.: Robot navigation in dense human crowds: statistical models and experimental studies of human-robot cooperation. Int. J. Robot. Res. 34, 335–356 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Gao, Y., Liu, X. (2022). Location Aware Workflow Migration Based on Deep Reinforcement Learning in Mobile Edge Computing. In: Lai, Y., Wang, T., Jiang, M., Xu, G., Liang, W., Castiglione, A. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2021. Lecture Notes in Computer Science(), vol 13155. Springer, Cham. https://doi.org/10.1007/978-3-030-95384-3_32
Download citation
DOI: https://doi.org/10.1007/978-3-030-95384-3_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-95383-6
Online ISBN: 978-3-030-95384-3
eBook Packages: Computer ScienceComputer Science (R0)