This work introduces an algorithm called Digital Twin-Aided Contextual Bandit Learning-based Two-Sided Matching (DTCBL-TSM), to efficiently offload computation tasks in dynamic fog computing networks (FCNs). Our proposed framework leverages digital twins (DTs) to enable precise monitoring and prediction of resource states of fog nodes (FNs). By integrating contextual bandit learning, our approach effectively handles the changing network conditions by the optimal learning strategy over time. Indeed, the two-sided matching mechanism ensures a balanced and fair allocation of tasks to fog nodes, considering both the task requirements and node capacities. Extensive simulations demonstrate that DTCBL-TSM outperforms existing methods in terms of task completion time, resource utilization, and adaptability to network dynamics.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Digital Twin-Aided Contextual Bandit Learning-Based Two-Sided Matching for Task Offloading in Dynamic Fog Computing Networks

  • Hoa Tran-Dang,
  • Dong-Seong Kim

摘要

This work introduces an algorithm called Digital Twin-Aided Contextual Bandit Learning-based Two-Sided Matching (DTCBL-TSM), to efficiently offload computation tasks in dynamic fog computing networks (FCNs). Our proposed framework leverages digital twins (DTs) to enable precise monitoring and prediction of resource states of fog nodes (FNs). By integrating contextual bandit learning, our approach effectively handles the changing network conditions by the optimal learning strategy over time. Indeed, the two-sided matching mechanism ensures a balanced and fair allocation of tasks to fog nodes, considering both the task requirements and node capacities. Extensive simulations demonstrate that DTCBL-TSM outperforms existing methods in terms of task completion time, resource utilization, and adaptability to network dynamics.