In this paper, the imbalance edge cloud based computing offloading for multiple mobile users (MUs) with multiple tasks per MU is studied. In which, several edge cloud servers (ECSs) are shared and accessed by multiple wireless access points (APs) with the backhaul links, and each MU has multiple computing intensive and latency critical tasks should be offloaded to execute, which involves both the AP association and ECS selection, with the objective of minimizing the offloading cost. Distinguished with existing research, besides the transmission delay and energy consumption from MU to AP, the ECS access-cost which characterizes the ECS access delay and (or) resource using cost is introduced, thus finally formulates the delay-energy-cost tradeoff based offloading cost criteria, for the MUs' offloading decision and resource allocation problems. In specific, in our system, the ECS access-cost depends on both the AP and ECS, which reflects the effects of different backhaul techniques used by these APs, and their negotiated payments of ECS resource using under different service level agreements. Both problems of minimizing the sum offloading costs for all MUs (efficiency-based) and minimizing the maximal offloading cost per MU (fairness-based) are discussed. Since these problems are all NP-hard. Therefore, some centralized and distributed heuristic algorithms are proposed to find the suboptimal solutions. Further analysis and numerical results are presented at last to demonstrate the performance of these algorithms from several aspects, such as efficiency, complexity and fairness.
Green Offloading in Fog-Assisted IoT Systems: An Online Perspective Integrating Learning and Control
School of Information Science and Technology, ShanghaiTech University(上海科技大学信息科学与技术学院)
在雾辅助物联网系统中,通常的做法是将任务从物联网设备卸载到其附近的雾节点,以减少任务处理延迟和能耗。然而,在线节能方案的设计仍然是一个开放的问题,因为各种不确定性的系统动力学,如处理能力和传输速率。此外,决策过程受到雾节点和物联网设备资源限制的约束,使设计更加复杂。在本文中,我们制定这样的任务卸载问题与未知的系统动力学作为一个组合的多臂强盗(CMAB)问题的长期约束的时间平均能耗。通过在线学习和在线控制的有效结合,我们提出了一个\textit{Learning-Aided Green Offloading}(LAGO)计划。在LAGO中,我们采用强盗学习方法来处理开发探索权衡,并利用虚拟队列技术来处理长期约束。我们的理论分析表明,LAGO可以减少平均任务延迟与一个可调的次线性遗憾界在有限的时间范围内,并满足长期的时间平均能量约束。我们进行了大量的模拟来验证这些理论结果。
Contextual-Bandit Anomaly Detection for IoT Data in Distributed Hierarchical Edge Computing
Singapore University of Technology and Design(新加坡科技设计大学);Institute for Infocomm Research, A*STAR(新加坡科技研究局资讯通信研究院);Missouri University of Science and Technology(密苏里科技大学);CNRS(法国国家科学研究中心);Telecom Sud Paris(南巴黎电信学院);Institut Mines Telecom(矿业电信学院);Paris-Saclay University(巴黎-萨克雷大学)