Mobility-induced service migration in mobile micro-clouds
File(s)WS_MILCOM2014.pdf (810.43 KB)
Accepted version
Author(s)
Type
Conference Paper
Abstract
Mobile micro-cloud is an emerging technology in
distributed computing, which is aimed at providing seamless
computing/data access to the edge of the network when a
centralized service may suffer from poor connectivity and long
latency. Different from the traditional cloud, a mobile micro-cloud
is smaller and deployed closer to users, typically attached to a
cellular basestation or wireless network access point. Due to the
relatively small coverage area of each basestation or access point,
when a user moves across areas covered by different basestations
or access points which are attached to different micro-clouds,
issues of service performance and service migration become
important. In this paper, we consider such migration issues. We
model the general problem as a Markov decision process (MDP),
and show that, in the special case where the mobile user follows
a one-dimensional asymmetric random walk mobility model, the
optimal policy for service migration is a threshold policy. We
obtain the analytical solution for the cost resulting from arbitrary
thresholds, and then propose an algorithm for finding the optimal
thresholds. The proposed algorithm is more efficient than standard
mechanisms for solving MDPs.
distributed computing, which is aimed at providing seamless
computing/data access to the edge of the network when a
centralized service may suffer from poor connectivity and long
latency. Different from the traditional cloud, a mobile micro-cloud
is smaller and deployed closer to users, typically attached to a
cellular basestation or wireless network access point. Due to the
relatively small coverage area of each basestation or access point,
when a user moves across areas covered by different basestations
or access points which are attached to different micro-clouds,
issues of service performance and service migration become
important. In this paper, we consider such migration issues. We
model the general problem as a Markov decision process (MDP),
and show that, in the special case where the mobile user follows
a one-dimensional asymmetric random walk mobility model, the
optimal policy for service migration is a threshold policy. We
obtain the analytical solution for the cost resulting from arbitrary
thresholds, and then propose an algorithm for finding the optimal
thresholds. The proposed algorithm is more efficient than standard
mechanisms for solving MDPs.
Date Issued
2014-10-06
Citation
2014, pp.835-840
Publisher
IEEE
Start Page
835
End Page
840
Copyright Statement
© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Source
Military Communications Conference (MILCOM), 2014 IEEE
Publication Status
Published
Start Date
2014-10-06
Coverage Spatial
Baltimore, MD