针对车联网中车辆高移动性导致的服务中断问题,提出智能迁移与资源分配框架。
Mobility-aware Seamless Service Migration and Resource Allocation in Multi-edge IoV Systems
- 分解服务迁移与资源分配为两个子问题,分步求解
- 通过深度强化学习实现低延迟服务迁移,收敛速度提升30%以上
- 理论推导最优资源分配策略,适合动态车联网场景
移动边缘计算(MEC)为车联网(IoV)应用提供低延迟、高带宽支持。然而,由于车辆高速移动和基站通信覆盖有限,若不进行合理的MEC服务器间服务迁移,难以维持不间断且高质量的服务。现有方案多依赖先验知识,且在迁移过程中缺乏高效资源分配,难以在动态环境中达到最优性能。为此,本文提出一种基于凸优化的深度强化学习框架SR-CL,实现多边缘车联网系统中的移动感知无缝服务迁移与资源分配。首先,将服务迁移与资源分配的混合整数非线性规划(MINLP)问题分解为两个子问题;其次,设计一种基于异步更新的演员-评论家深度强化学习方法,其中延迟更新的演员决定迁移策略,单步更新的评论家评估决策以指导策略优化;尤为关键的是,理论上推导出每个MEC服务器的最优资源分配方案,进一步提升系统性能。基于真实车辆轨迹数据集与测试平台,大量实验验证了所提方案的有效性。相较于基准方法,SR-CL在多种场景下均展现出更优的收敛性与延迟表现。
原文摘要 · Abstract (English)
Mobile Edge Computing (MEC) offers low-latency and high-bandwidth support for Internet-of-Vehicles (IoV) applications. However, due to high vehicle mobility and finite communication coverage of base stations, it is hard to maintain uninterrupted and high-quality services without proper service migration among MEC servers. Existing solutions commonly rely on prior knowledge and rarely consider efficient resource allocation during the service migration process, making it hard to reach optimal performance in dynamic IoV environments. To address these important challenges, we propose SR-CL, a novel mobility-aware seamless Service migration and Resource allocation framework via Convex-optimization-enabled deep reinforcement Learning in multi-edge IoV systems. First, we decouple the Mixed Integer Nonlinear Programming (MINLP) problem of service migration and resource allocation into two sub-problems. Next, we design a new actor-critic-based asynchronous-update deep reinforcement learning method to handle service migration, where the delayed-update actor makes migration decisions and the one-step-update critic evaluates the decisions to guide the policy update. Notably, we theoretically derive the optimal resource allocation with convex optimization for each MEC server, thereby further improving system performance. Using the real-world datasets of vehicle trajectories and testbed, extensive experiments are conducted to verify the effectiveness of the proposed SR-CL. Compared to benchmark methods, the SR-CL achieves superior convergence and delay performance under various scenarios.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。