PoPeC: PAoI-Centric Task Offloading With Priority Over Unreliable Channels

Freshness-aware computation offloading has garnered increasing attention recently in the realm of edge computing, driven by the need to promptly obtain up-to-date information and mitigate the transmission of outdated data. However, most of the existing works assume that channels are reliable, neglec...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 2024-06, Vol.32 (3), p.2376-2390
Main Authors: Qiao, Nan, Yue, Sheng, Zhang, Yongmin, Ren, Ju
Format: Article
Language:English
Subjects:
Algorithms
channel allocation
Channels
Computation offloading
Computational modeling
Distributed task offloading
Edge computing
Freshness
Heterogeneity
Mathematical programming
Optimization
Real-time systems
Resource allocation
Resource management
Resource scheduling
Servers
system freshness
Task analysis
Task scheduling
Wireless communication
Wireless communications
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Freshness-aware computation offloading has garnered increasing attention recently in the realm of edge computing, driven by the need to promptly obtain up-to-date information and mitigate the transmission of outdated data. However, most of the existing works assume that channels are reliable, neglecting the intrinsic fluctuations and uncertainty in wireless communication. More importantly, offloading tasks typically have diverse freshness requirements. Accommodation of various task priorities in the context of freshness-aware task scheduling and resource allocation remains an open and unresolved problem. To overcome these limitations, we cast the freshness-aware task offloading problem as a multi-priority optimization problem, considering the unreliability of wireless channels, prioritized users, and the heterogeneity of edge servers. Building upon the nonlinear fractional programming and the ADMM-Consensus method, we introduce a joint resource allocation and task offloading algorithm to solve the original problem iteratively. In addition, we devise a distributed asynchronous variant for the proposed algorithm to further enhance its communication efficiency. We rigorously analyze the performance and convergence of our approaches and conduct extensive simulations to corroborate their efficacy and superiority over the existing baselines.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2024.3350198