...
首页> 外文期刊>IEEE Transactions on Vehicular Technology >Edge-Centric Bandit Learning for Task-Offloading Allocations in Multi-RAT Heterogeneous Networks
【24h】

Edge-Centric Bandit Learning for Task-Offloading Allocations in Multi-RAT Heterogeneous Networks

机译:用于多重大鼠异构网络中任务卸载分配的边缘中心的匪徒学习

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

The exponential growth of data traffic from mobile devices leads to a need of heterogeneous networks (HetNets) which integrate multiple radio access technologies (multi-RATs) to allocate task-offloading with quick coordination. In this paper, we present a novel mobile edge computing (MEC) architecture for multi-RAT HetNets, and propose an MEC-centric offloading decision mechanism. By formulating the intended task as a multi-armed bandit (MAB) problem, we develop a fronthaul-aware upper confidence bound (FA-UCB) algorithm that is able to deal with uncertainty and asymmetry of network state information. It is rigorously established that the proposed FA-UCB algorithm has a sublinear regret bound against the optimal benchmark with full a-priori knowledge, given that the backhaul delays are independently and identically distributed over time. Furthermore, under a restless martingale (RM) bandit condition, we put forth a generalized RM-FA-UCB algorithm that can achieve a sublinear regret bound even under non-stationary network dynamics. Numerical results demonstrate the merits of the proposed schemes and algorithms.
机译:数据流量的指数级增长,从移动设备导致需要它集成多种无线接入技术(多RAT)来与快速协调分配任务卸载异构网络(HetNet中)的。在本文中,我们提出了一种新颖的边缘移动计算用于多RAT HetNet中(MEC)的架构,并提出一个MEC为中心的卸载的决定机构。通过制定预期的任务作为多臂老虎机(MAB)问题,我们开发了一个结合fronthaul感知上的信心(FA-UCB)算法,能够应对不确定性和网络状态信息的不对称性。这是严格建立,所提出的FA-UCB算法势必对以饱满的先验知识的最佳标杆次线性遗憾,因为回程延迟独立同一段时间分布。此外,一个不安分的鞅(RM)匪条件下,我们提出一个广义的RM-FA-UCB算法,可以实现即使在非固定的网络动态绑定一个次线性遗憾。仿真结果表明,所提出的方法和算法的优劣。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号