4.7 Article

Learning-Aided Computation Offloading for Trusted Collaborative Mobile Edge Computing

期刊

IEEE TRANSACTIONS ON MOBILE COMPUTING
卷 19, 期 12, 页码 2833-2849

出版社

IEEE COMPUTER SOC
DOI: 10.1109/TMC.2019.2934103

关键词

Mobile edge computing; multi-hop cooperative offloading; trust propagation; completion latency variability

资金

  1. National Key R&D Program of China [2017YFB1003000, 2018YFB1004705, 2018YFB2100302]
  2. NSFC China [61672342, 61671478, 61602303, 61532012, 61822206, 61829201]
  3. Science and Technology Innovation Program of Shanghai [17511105103, 18510761200]
  4. Open Research Fund of National Mobile Communications Research Laboratory, Southeast University [2018D06]
  5. Shanghai Key Laboratory of Scalable Computing and Systems

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

Cooperative offloading in mobile edge computing enables resource-constrained edge clouds to help each other with computation-intensive tasks. However, the power of such offloading could not be fully unleashed, unless trust risks in collaboration are properly managed. As tasks are outsourced and processed at the network edge, completion latency usually presents high variability that can harm the offered service levels. By jointly considering these two challenges, we propose OLCD, an Online Learning-aided Cooperative offloaDing mechanism under the scenario where computation offloading is organized based on accumulated social trust. Under co-provisioning of computation, transmission, and trust services, trust propagation is performed along the multi-hop offloading path such that tasks are allowed to be fulfilled by powerful edge clouds. We harness Lyapunov optimization to exploit the spatial-temporal optimality of long-term system cost minimization problem. By gap-preserving transformation, we decouple the series of bidirectional offloading problems so that it suffices to solve a separate decision problem for each edge cloud. The optimal offloading control can not materialize without complete latency knowledge. To adapt to latency variability, we resort to the delayed online learning technique to facilitate completion latency prediction under long-duration processing, which is fed as input to queued-based offloading control policy. Such predictive control is specially designed to minimize the loss due to prediction errors over time. We theoretically prove that OLCD guarantees close-to-optimal system performance even with inaccurate prediction, but its robustness is achieved at the expense of decreased stability. Trace-driven simulations demonstrate the efficiency of OLCD as well as its superiorities over prior related work.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据