Journal
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
Volume 68, Issue 11, Pages 11399-11403Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TVT.2019.2943647
Keywords
Fog computing; multi-armed bandit; task offloading; delay minimization; combinatorial multi-armed bandits
Categories
Funding
- National Natural Science Foundation of China [61801463]
- Nature Science Foundation of Shanghai [19ZR1433900]
Ask authors/readers for more resources
Fog computing has the potential to liberate the computation-intensive mobile devices by task offloading. In this paper, we propose an online learning based task offloading algorithm for delay-sensitive applications in dynamic fog networks, which combines with the Combinatorial Multi-Armed Bandits (CMAB) framework. First, the proposed algorithm learns the sharing computing resources of fog nodes at a negligible computational cost. Then, we aim to minimize the task's offloading latency by jointly optimizing the task allocation decision and the spectrum scheduling. Finally, simulation results show that the proposed algorithm achieves much better delay performance than the traditional Upper Confidence Bound (UCB) algorithm and maintains ultra-low offloading delay in dynamic system state.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available