Motivated by various delay sensitive applications, we address the problem of coordinating the offloading decisions of wireless devices that periodically generate computationally intensive tasks. We consider autonomous devices that aim at minimizing their own cost by choosing when to perform their tasks and whether or not to offload their tasks to an edge cloud through one of the multiple wireless links. We develop a game theoretical model of the problem, prove the existence of pure strategy Nash equilibria and propose a polynomial complexity algorithm for computing an equilibrium. Furthermore, we characterize the structure of the equilibria, and by providing an upper bound on the price of anarchy of the game we establish an asymptotically tight bound on the approximation ratio of the proposed algorithm. Our simulation results show that the proposed algorithm achieves significant performance gain compared to uncoordinated computation offloading at a computational complexity that is on average linear in the number of devices.

中文翻译：

---

移动边缘计算中周期性任务的计算卸载调度


在各种延迟敏感应用程序的推动下，我们解决了协调定期生成计算密集型任务的无线设备的卸载决策的问题。我们考虑的自主设备旨在通过选择何时执行任务以及是否通过多个无线链路之一将其任务卸载到边缘云来最大限度地降低自身成本。我们开发了该问题的博弈论模型，证明了纯策略纳什均衡的存在，并提出了用于计算均衡的多项式复杂性算法。此外，我们描述了均衡的结构，并通过提供游戏无政府状态价格的上限，我们对所提出的算法的近似率建立了渐近紧界。我们的仿真结果表明，与不协调的计算卸载相比，所提出的算法在计算复杂度与设备数量平均呈线性关系的情况下实现了显着的性能增益。