Bowen Yang, Pengchao Han, Chuan Feng, Yejun Liu, Lei Guo
{"title":"移动边缘计算中基于高阶MDP的业务迁移","authors":"Bowen Yang, Pengchao Han, Chuan Feng, Yejun Liu, Lei Guo","doi":"10.1109/ICCSN52437.2021.9463603","DOIUrl":null,"url":null,"abstract":"Mobile Edge Computing (MEC) has gained a lot of popularity for supporting newly emerging services with low latency by deploying servers in base stations (BSs). For a moving user, the Quality of Service (QoS) needs to be guaranteed through service migration among edge servers. To avoid service interruption, determining when and where to migrate services is critical and challenging for users with unknown future trajectories. Besides, frequent service migration incurs unexpected high network resource consumption, resulting in a trade-off between QoS and resource cost. In this paper, we focus on the problem of service migration in MEC networks aiming at minimizing the total resource cost while guaranteeing the QoS of moving users. We innovatively model the service migration of a user using k-order Markov Decision Process (MDP), where the correlation of user’s historical locations is taken in account to help better decision. The optimal correlation coefficient k is obtained through analyzing the real-world dataset of taxi trajectories. An online algorithm based on Deep Q-Network (DQN) is proposed to solve the service migration problem to minimize the long-term communication and migration costs. Compared with the widely-used benchmarks, our algorithm shows a better performance in reducing communication and migration costs under different parameter settings.","PeriodicalId":263568,"journal":{"name":"2021 13th International Conference on Communication Software and Networks (ICCSN)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Service Migration with High-Order MDP in Mobile Edge Computing\",\"authors\":\"Bowen Yang, Pengchao Han, Chuan Feng, Yejun Liu, Lei Guo\",\"doi\":\"10.1109/ICCSN52437.2021.9463603\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile Edge Computing (MEC) has gained a lot of popularity for supporting newly emerging services with low latency by deploying servers in base stations (BSs). For a moving user, the Quality of Service (QoS) needs to be guaranteed through service migration among edge servers. To avoid service interruption, determining when and where to migrate services is critical and challenging for users with unknown future trajectories. Besides, frequent service migration incurs unexpected high network resource consumption, resulting in a trade-off between QoS and resource cost. In this paper, we focus on the problem of service migration in MEC networks aiming at minimizing the total resource cost while guaranteeing the QoS of moving users. We innovatively model the service migration of a user using k-order Markov Decision Process (MDP), where the correlation of user’s historical locations is taken in account to help better decision. The optimal correlation coefficient k is obtained through analyzing the real-world dataset of taxi trajectories. An online algorithm based on Deep Q-Network (DQN) is proposed to solve the service migration problem to minimize the long-term communication and migration costs. Compared with the widely-used benchmarks, our algorithm shows a better performance in reducing communication and migration costs under different parameter settings.\",\"PeriodicalId\":263568,\"journal\":{\"name\":\"2021 13th International Conference on Communication Software and Networks (ICCSN)\",\"volume\":\"143 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 13th International Conference on Communication Software and Networks (ICCSN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSN52437.2021.9463603\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 13th International Conference on Communication Software and Networks (ICCSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSN52437.2021.9463603","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
摘要
移动边缘计算(MEC)通过在基站(BSs)中部署服务器来支持具有低延迟的新兴服务,因此受到了广泛的欢迎。对于移动用户,需要通过边缘服务器之间的业务迁移来保证QoS (Quality of Service)。为了避免服务中断,对于未来发展轨迹未知的用户来说,确定何时何地迁移服务是至关重要的,也是具有挑战性的。此外,频繁的业务迁移会导致意想不到的高网络资源消耗,导致QoS和资源成本之间的权衡。本文主要研究MEC网络中的业务迁移问题,其目的是在保证移动用户的QoS的同时使总资源成本最小化。我们创新地使用k阶马尔可夫决策过程(MDP)对用户的服务迁移建模,其中考虑了用户历史位置的相关性,以帮助更好地决策。通过分析出租车轨迹的真实数据集,得到最优相关系数k。提出了一种基于深度q网络(Deep Q-Network, DQN)的在线迁移算法来解决业务迁移问题,以最小化长期通信和迁移成本。与广泛使用的基准测试相比,在不同参数设置下,我们的算法在降低通信和迁移成本方面表现出更好的性能。
Service Migration with High-Order MDP in Mobile Edge Computing
Mobile Edge Computing (MEC) has gained a lot of popularity for supporting newly emerging services with low latency by deploying servers in base stations (BSs). For a moving user, the Quality of Service (QoS) needs to be guaranteed through service migration among edge servers. To avoid service interruption, determining when and where to migrate services is critical and challenging for users with unknown future trajectories. Besides, frequent service migration incurs unexpected high network resource consumption, resulting in a trade-off between QoS and resource cost. In this paper, we focus on the problem of service migration in MEC networks aiming at minimizing the total resource cost while guaranteeing the QoS of moving users. We innovatively model the service migration of a user using k-order Markov Decision Process (MDP), where the correlation of user’s historical locations is taken in account to help better decision. The optimal correlation coefficient k is obtained through analyzing the real-world dataset of taxi trajectories. An online algorithm based on Deep Q-Network (DQN) is proposed to solve the service migration problem to minimize the long-term communication and migration costs. Compared with the widely-used benchmarks, our algorithm shows a better performance in reducing communication and migration costs under different parameter settings.