Intelligent Task Caching in Edge Cloud via Bandit Learning

被引:2
作者
Miao, Yiming [1 ]
Hao, Yixue [1 ]
Chen, Min [2 ,3 ]
Gharavi, Hamid [4 ]
Hwang, Kai [5 ,6 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan 430074, Peoples R China
[2] Huazhong Univ Sci & Technol, Dept Comp Sci & Technol, Wuhan 430074, Peoples R China
[3] Wuhan Natl Lab Optoelect, Wuhan 430074, Peoples R China
[4] NIST, Gaithersburg, MD 20899 USA
[5] Chinese Univ Hong Kong, Shenzhen Inst Artificial Intelligence & Robot Soc, Shenzhen 518172, Peoples R China
[6] Chinese Univ Hong Kong, Sch Data Sci SDS, Shenzhen 518172, Peoples R China
来源
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING | 2021年 / 8卷 / 01期
基金
国家重点研发计划;
关键词
Task analysis; Cloud computing; Mobile handsets; Heuristic algorithms; Prediction algorithms; Delays; Computational modeling; Bandit learning; edge caching; edge cloud computing; task caching; RESOURCE-ALLOCATION; MOBILE; COMPUTATION;
D O I
10.1109/TNSE.2020.3047417
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Task caching, based on edge cloud, aims to meet the latency requirements of computation-intensive and data-intensive tasks (such as augmented reality). However, current task caching strategies are generally based on the unrealistic assumption of knowing the pattern of user task requests and ignoring the fact that a task request pattern is more user specific (e.g., the mobility and personalized task demand). Moreover, it disregards the impact of task size and computing amount on the caching strategy. To investigate these issues, in this paper, we first formalize the task caching problem as a non-linear integer programming problem to minimize task latency. We then design a novel intelligent task caching algorithm based on a multi-armed bandit algorithm, called M-adaptive upper confidence bound (M-AUCB). The proposed caching strategy cannot only learn the task patterns of mobile device requests online, but can also dynamically adjust the caching strategy to incorporate the size and computing amount of each task. Moreover, we prove that the M-AUCB algorithm achieves a sublinear regret bound. The results show that, compared with other task caching schemes, the M-AUCB algorithm reduces the average task latency by at least 14.8%.
引用
收藏
页码:625 / 637
页数:13
相关论文
共 34 条
[1]   Video Stream Analysis in Clouds: An Object Detection and Classification Framework for High Performance Video Analytics [J].
Anjum, Ashiq ;
Abdullah, Tariq ;
Tariq, M. Fahim ;
Baltaci, Yusuf ;
Antonopoulos, Nick .
IEEE TRANSACTIONS ON CLOUD COMPUTING, 2019, 7 (04) :1152-1167
[2]  
Asadi A, 2018, IEEE INFOCOM SER, P1970
[3]   Finite-time analysis of the multiarmed bandit problem [J].
Auer, P ;
Cesa-Bianchi, N ;
Fischer, P .
MACHINE LEARNING, 2002, 47 (2-3) :235-256
[4]   Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems [J].
Bubeck, Sebastien ;
Cesa-Bianchi, Nicolo .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2012, 5 (01) :1-122
[5]   Jointly Optimizing Content Caching and Recommendations in Small Cell Networks [J].
Chatzieleftheriou, Livia Elena ;
Karaliopoulos, Merkouris ;
Koutsopoulos, Iordanis .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2019, 18 (01) :125-138
[6]  
Chen L, 2018, ARXIV181204575
[7]   Spatio-Temporal Edge Service Placement: A Bandit Learning Approach [J].
Chen, Lixing ;
Xu, Jie ;
Ren, Shaolei ;
Zhou, Pan .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17 (12) :8388-8401
[8]   Adaptive Fog Configuration for the Industrial Internet of Things [J].
Chen, Lixing ;
Zhou, Pan ;
Gao, Liang ;
Xu, Jie .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2018, 14 (10) :4656-4664
[9]   EDGE-COCACO: TOWARD JOINT OPTIMIZATION OF COMPUTATION, CACHING, AND COMMUNICATION ON EDGE CLOUD [J].
Chen, Min ;
Hao, Yixue ;
Hu, Long ;
Hossain, M. Shamim ;
Ghoneim, Ahmed .
IEEE WIRELESS COMMUNICATIONS, 2018, 25 (03) :21-27
[10]  
Farhadi V, 2019, IEEE INFOCOM SER, P1279, DOI [10.1109/INFOCOM.2019.8737368, 10.1109/infocom.2019.8737368]