Path Selection for Seamless Service Migration in Vehicular Edge Computing

Mobile-edge computing provisions computing and storage resources by deploying edge servers (ESs) at the edge of the network to support ultralow delay and high bandwidth services. To ensure QoS of latency-sensitive services in vehicular networks, service migration is required to migrate data of the ongoing services to the closest ES seamlessly when users move across different ESs. To achieve seamless service migration, path selection is proposed to obtain one or more paths (consisting of several switches and ESs) to transfer service data. We focus on the following problems about path selection: 1) where to implement path selection? 2) how to coordinate interests of mobile users (i.e., vehicles) and network providers since they have conflicting interests during path selection? and 3) how to ensure seamless service migration during the migration of vehicles? To address the above problems, this article investigates path selection for seamless service migration. We propose a path-selection algorithm to jointly optimize both interests of the network plane (i.e., the cost for network providers) and service plane (i.e., QoE of users). We first formulate it as a multiobjective optimization problem and further prove theoretically that the proposed algorithm can give a
weakly Pareto-optimal solution
. Moreover, to improve the scalability of the proposed algorithm, a distance-based filter strategy is designed to eliminate undesired switches in advance. We conduct experiments on two synthesized data sets and the results validate the effectiveness of the proposed algorithm.