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

초록

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; Kim, Dong-Seong
DOI
10.1007/978-981-96-6938-7_14
발행일
2025-02-21
학회명
10th International Congress on Information and Communication Technology-ICICT-Annual
개최지
ENGLAND
개최국가
싱가포르
학회 개최일
2025-02-18 ~ 2025-02-21