共 35 条
Potential Game Based Distributed IoV Service Offloading With Graph Attention Networks in Mobile Edge Computing
被引:3
作者:
Jiang, Qinting
[1
,2
]
Xu, Xiaolong
[1
]
Bilal, Muhammad
[3
]
Crowcroft, Jon
[4
]
Liu, Qi
[5
]
Dou, Wanchun
[6
]
Jiang, Jingyan
[7
]
机构:
[1] Nanjing Univ Informat Sci & Technol, Sch Software, Nanjing 210044, Peoples R China
[2] Tsinghua Univ, SIGS, Shenzhen 518055, Peoples R China
[3] Univ Lancaster, Sch Comp & Commun, Lancaster LA1 4WA, England
[4] Univ Cambridge, Dept Comp Sci & Technol, Cambridge CB3 0FD, England
[5] Nanjing Univ Informat Sci & Technol, Sch Comp Sci, Nanjing 210044, Peoples R China
[6] Nanjing Univ, State Key Lab Novel Software Technol, Nanjing 210023, Peoples R China
[7] Shenzhen Technol Univ, Coll Big Data & Internet, Shenzhen 518118, Peoples R China
基金:
中国国家自然科学基金;
关键词:
Service offloading;
edge computing;
graph attention network;
game theory;
flow forecasting;
RESOURCE-ALLOCATION;
D O I:
10.1109/TITS.2024.3369190
中图分类号:
TU [建筑科学];
学科分类号:
0813 ;
摘要:
Vehicular services aim to provide smart and timely services (e.g., collision warning) by taking the advantage of recent advances in artificial intelligence and employing task offloading techniques in mobile edge computing. In practice, the volume of vehicles in the Internet of Vehicles (IoV) often surges at a single location and renders the edge servers (ESs) severely overloaded, resulting in a very high delay in delivering the services. Therefore, it is of practical importance and urgency to coordinate the resources of ESs with bandwidth allocation for mitigating the occurrence of a spike traffic flow. For this challenge, existing work sought the periodicities of traffic flow by analyzing historical traffic data. However, the changes in traffic flow caused by sudden traffic conditions cannot be obtained from these periodicities. In this paper, we propose a distributed traffic flow forecasting and task offloading approach named TFFTO to optimize the execution time and power consumption in service processing. Specifically, graph attention networks (GATs) are leveraged to forecast future traffic flow in short-term and the traffic volume is utilized to estimate the number of services offloaded to the ESs in the subsequent period. With the estimate, the current load of the ESs is adjusted to ensure that the services can be handled in a timely manner. Potential game theory is adopted to determine the optimal service offloading strategy. Extensive experiments are conducted to evaluate our approach and the results validate our robust performance.
引用
收藏
页码:10912 / 10925
页数:14
相关论文