TY - GEN
T1 - Throughput maximization for online request admissions in mobile cloudlets
AU - Xia, Qiufen
AU - Liang, Weifa
AU - Xu, Wenzheng
PY - 2013
Y1 - 2013
N2 - In mobile cloud computing (MCC) paradigm, cloud service providers not only offer powerful cloud data centers but also provide small-scale cloudlets in some strategic locations for mobile users to access their rich resources. Due to the flexibility and locality of cloudlets, most requests of mobile users can be processed locally. However, the cloudlets usually have limited resources and processing abilities, which implies that they may not be capable to process every incoming request. Instead, some resource-intensive requests need to be sent to remote data centers for processing and such a processing is transparent to users. In this paper, we address the online request admission issue in a cloudlet with an objective to maximize the system throughput, for which we first propose a novel admission cost model to model critical resource consumptions. We then devise efficient control algorithms for online request admissions. We finally conduct experiments by simulations to evaluate the performance of the proposed algorithms. Experimental results indicate that the proposed algorithms are promising and outperform other heuristics.
AB - In mobile cloud computing (MCC) paradigm, cloud service providers not only offer powerful cloud data centers but also provide small-scale cloudlets in some strategic locations for mobile users to access their rich resources. Due to the flexibility and locality of cloudlets, most requests of mobile users can be processed locally. However, the cloudlets usually have limited resources and processing abilities, which implies that they may not be capable to process every incoming request. Instead, some resource-intensive requests need to be sent to remote data centers for processing and such a processing is transparent to users. In this paper, we address the online request admission issue in a cloudlet with an objective to maximize the system throughput, for which we first propose a novel admission cost model to model critical resource consumptions. We then devise efficient control algorithms for online request admissions. We finally conduct experiments by simulations to evaluate the performance of the proposed algorithms. Experimental results indicate that the proposed algorithms are promising and outperform other heuristics.
UR - http://www.scopus.com/inward/record.url?scp=84898023005&partnerID=8YFLogxK
U2 - 10.1109/LCN.2013.6761295
DO - 10.1109/LCN.2013.6761295
M3 - Conference contribution
SN - 9781479905379
T3 - Proceedings - Conference on Local Computer Networks, LCN
SP - 589
EP - 596
BT - Proceedings of the 38th Annual IEEE Conference on Local Computer Networks, LCN 2013
PB - IEEE Computer Society
T2 - 38th Annual IEEE Conference on Local Computer Networks, LCN 2013
Y2 - 21 October 2013 through 24 October 2013
ER -