QoS-Aware Cloudlet Load Balancing in Wireless Metropolitan Area Networks

被引:25
作者
Jia, Mike [1 ]
Liang, Weifa [1 ]
Xu, Zichuan [2 ]
Huang, Meitian [1 ]
Ma, Yu [1 ]
机构
[1] Australian Natl Univ, Res Sch Comp Sci, Canberra, ACT 0200, Australia
[2] Dalian Univ Technol, Sch Software, Dalian 116620, Peoples R China
关键词
Cloudlet placements; mobile user allocation; task response time minimization; mobile task offloading; mobile cloud computing; GENETIC-ALGORITHM; MOBILE; SYSTEMS;
D O I
10.1109/TCC.2017.2786738
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With advances in wireless communication technology, more and more people depend heavily on portable mobile devices for business, entertainments and social interactions. This poses a great challenge of building a seamless application experience across different computing platforms. A key issue is the resource limitations of mobile devices due to their portable size, however this can be overcome by offloading computation-intensive tasks from the mobile devices to clusters of nearby computers called cloudlets through wireless access points. As increasing numbers of people access the Internet via mobile devices, it is reasonable to envision in the near future that cloudlet services will be available for the public through easily accessible public wireless metropolitan area networks (WMANs). However, the outdated notion of treating cloudlets as isolated data-centers-in-boxes must be discarded as there are clear benefits to connecting multiple cloudlets together to form a network. In this paper we investigate how to balance the workload among cloudlets in an WMAN to optimize mobile application performance. We first introduce a novel system model to capture the response time delays of offloaded tasks and formulate an optimization problem with the aim to minimize the maximum response time of all offloaded tasks. We then propose two algorithms for the problem: one is a fast heuristic, and another is a distributed genetic algorithm that is capable of delivering a more accurate solution compared with the first algorithm, but at the expense of a much longer running time. We finally evaluate the performance of the proposed algorithms in realistic simulation environments. The experimental results demonstrate the significant potential of the proposed algorithms in reducing the user task response time, maximizing user experience.
引用
收藏
页码:623 / 634
页数:12
相关论文
共 35 条
  • [1] Alba Enrique, 1999, Complexity, V4, P31, DOI 10.1002/(SICI)1099-0526(199903/04)4:4<31::AID-CPLX5>3.0.CO
  • [2] 2-4
  • [3] Internet -: Diameter of the World-Wide Web
    Albert, R
    Jeong, H
    Barabási, AL
    [J]. NATURE, 1999, 401 (6749) : 130 - 131
  • [4] Alizadeh M, 2012, IEEE CONF OPEN SYST, P196
  • [5] [Anonymous], 2016, CHINESE MED J-PEKING, DOI DOI 10.1109/INFOCOM.2016.7524411
  • [6] [Anonymous], P 2 INT C GEN ALG
  • [7] Balan Rajesh., 2002, EW10, P87, DOI DOI 10.1145/1133373.1133390
  • [8] Cant-Paz E., 1995, 95007 U ILL URB CHAM
  • [9] Cardellini V., 2013, A game-theoretic approach to computation offloading in mobile cloud computing
  • [10] Mobile Edge Cloud Network Design Optimization
    Ceselli, Alberto
    Premoli, Marco
    Secci, Stefano
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2017, 25 (03) : 1818 - 1831