3.8 Proceedings Paper

Cloudlet Placement and Minimum-Delay Routing in Cloudlet Computing

出版社

IEEE
DOI: 10.1109/BIGCOM.2017.58

关键词

Cloudlet placement; Online routing of job requests; Cloudlet computing; Access delay minimization

资金

  1. NSFC [61502201, 61520106007]
  2. China National Funds for Distinguished Young Scientists [61625205]
  3. Key Research Program of Frontier Sciences of CAS [QYZDY-SSW-JSC002]
  4. NSF [ECCS-1247944, CMMI 1436786, CNS 1526638]
  5. NSF-Guangdong [2014A030310172]
  6. Fundamental Research Funds for the Central Universities

向作者/读者索取更多资源

Mobile applications becomes increasingly computation intensive, while the computing capability of portable mobile devices is limited. Although cloud computing is emerging as a main ubiquitous platform to provide rich cloud resources for various mobile applications, the communication delay between mobile devices and remote clouds is difficult to control. A promising solution is to deploy clusters of computers near mobile users, called Cloudlets, so that mobile devices can offload their job requests to cloudlets with low latency. There has been a body of research in cloudlet computing, but little attention has been paid to cloudlet placement and routing of job requests. In this paper, we study how to place cloudlets to the wireless access points (APs), and how to route mobile job requests to minimize the communication latency. In order to cope with dynamic arrivals of mobile job requests, we first construct a number of snapshots among different time intervals based on the historical data. And then we derive an approximation algorithm for each snapshot to select some APs as candidate locations for the final locations of cloudlets. Finally we design an iterative algorithm to choose permanent locations to deploy cloudlets. Furthermore, based on the placement strategy, we propose an online job routing algorithm to dispatch mobile job requests to cloudlets such that the total communication delay is minimized. Simulation results demonstrate that our proposed algorithms performances well, and our online solution is comparable with state-of-the-art off-line solutions in the literature.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据