TY - GEN
T1 - Security-aware service migration for tactical mobile micro-clouds
AU - Ciftcioglu, Ertugrul N.
AU - Chan, Kevin S.
AU - Urgaonkar, Rahul
AU - Wang, Shiqiang
AU - He, Ting
PY - 2015/12/14
Y1 - 2015/12/14
N2 - Mobile micro-clouds (MMCs), which are small cloud-like infrastructures that can host services for mobile users, provide a promising approach to deliver data and computation to users in low bandwidth/high latency networks. In this work, we take a step towards security-aware service migration for multiple servers for MMC in tactical environments. As a fundamental model, we consider two users sharing a cluster of MMCs and moving between coverage areas of different MMCs according to random walk. We formulate the problem using a finite horizon Markov Decision Process (MDP). Due to the coupling between users due to security (and possibly interference) costs, we observe that the problem is significantly more complex compared with the non-security-aware single user service migration problem studied in the literature, even in the simplest case of two users. Accordingly, we consider efficient control algorithms which aim to minimize time average costs. Particularly, we propose a modified myopic policy which aims to reduce time average costs by steering operation towards settings which would reduce the likelihood of future security cost increases, by proactively keeping the services distant. Our numerical results demonstrate that our modified myopic policy outperforms other policies in terms of average cost for various settings.
AB - Mobile micro-clouds (MMCs), which are small cloud-like infrastructures that can host services for mobile users, provide a promising approach to deliver data and computation to users in low bandwidth/high latency networks. In this work, we take a step towards security-aware service migration for multiple servers for MMC in tactical environments. As a fundamental model, we consider two users sharing a cluster of MMCs and moving between coverage areas of different MMCs according to random walk. We formulate the problem using a finite horizon Markov Decision Process (MDP). Due to the coupling between users due to security (and possibly interference) costs, we observe that the problem is significantly more complex compared with the non-security-aware single user service migration problem studied in the literature, even in the simplest case of two users. Accordingly, we consider efficient control algorithms which aim to minimize time average costs. Particularly, we propose a modified myopic policy which aims to reduce time average costs by steering operation towards settings which would reduce the likelihood of future security cost increases, by proactively keeping the services distant. Our numerical results demonstrate that our modified myopic policy outperforms other policies in terms of average cost for various settings.
UR - http://www.scopus.com/inward/record.url?scp=84959284591&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84959284591&partnerID=8YFLogxK
U2 - 10.1109/MILCOM.2015.7357585
DO - 10.1109/MILCOM.2015.7357585
M3 - Conference contribution
AN - SCOPUS:84959284591
T3 - Proceedings - IEEE Military Communications Conference MILCOM
SP - 1058
EP - 1063
BT - 2015 IEEE Military Communications Conference, MILCOM 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 34th Annual IEEE Military Communications Conference, MILCOM 2015
Y2 - 26 October 2015 through 28 October 2015
ER -