TY - GEN
T1 - Multiple granularity online control of cloudlet networks for edge computing
AU - Jiao, Lei
AU - Pu, Lingjun
AU - Wang, Lin
AU - Lin, Xiaojun
AU - Li, Jun
PY - 2018/6/26
Y1 - 2018/6/26
N2 - Operating distributed cloudlets at optimal cost is nontrivial when facing not only the dynamic and unpredictable resource prices and user requests, but also the low efficiency of today's immature cloudlet infrastructures. We propose to control cloudlet networks at multiple granularities: fine-grained control of servers inside cloudlets and coarse-grained control of cloudlets themselves. We model this problem as a mixed-integer nonlinear program with the switching cost over time. To solve this problem online, we firstly linearize, "regularize", and decouple it into a series of one-shot subproblems that we solve at each corresponding time slot, and afterwards we design an iterative, dependent rounding framework using our proposed randomized pairwise rounding algorithm to convert the fractional control decisions into the integral ones at each time slot. Via rigorous theoretical analysis, we exhibit our approach's performance guarantee in terms of the competitive ratio and the multiplicative integrality gap towards the offline optimal integral decisions. Extensive evaluations with real-world data confirm the empirical superiority of our approach over the single granularity server control and the state-of-the-art algorithms.
AB - Operating distributed cloudlets at optimal cost is nontrivial when facing not only the dynamic and unpredictable resource prices and user requests, but also the low efficiency of today's immature cloudlet infrastructures. We propose to control cloudlet networks at multiple granularities: fine-grained control of servers inside cloudlets and coarse-grained control of cloudlets themselves. We model this problem as a mixed-integer nonlinear program with the switching cost over time. To solve this problem online, we firstly linearize, "regularize", and decouple it into a series of one-shot subproblems that we solve at each corresponding time slot, and afterwards we design an iterative, dependent rounding framework using our proposed randomized pairwise rounding algorithm to convert the fractional control decisions into the integral ones at each time slot. Via rigorous theoretical analysis, we exhibit our approach's performance guarantee in terms of the competitive ratio and the multiplicative integrality gap towards the offline optimal integral decisions. Extensive evaluations with real-world data confirm the empirical superiority of our approach over the single granularity server control and the state-of-the-art algorithms.
UR - http://www.scopus.com/inward/record.url?scp=85050208269&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85050208269&partnerID=8YFLogxK
U2 - 10.1109/SAHCN.2018.8397141
DO - 10.1109/SAHCN.2018.8397141
M3 - Conference contribution
AN - SCOPUS:85050208269
T3 - 2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking, SECON 2018
SP - 1
EP - 9
BT - 2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking, SECON 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 15th Annual IEEE International Conference on Sensing, Communication, and Networking, SECON 2018
Y2 - 11 June 2018 through 13 June 2018
ER -