Fully Decentralized Computation Offloading in Priority-Driven Edge Computing Systems
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909453237878784 |
|---|---|
| author | Aggarwal, Shubham Bastopcu, Melih Zaman, Muhammad Aneeq uz Başar, Tamer Ulukus, Sennur Akar, Nail |
| author_facet | Aggarwal, Shubham Bastopcu, Melih Zaman, Muhammad Aneeq uz Başar, Tamer Ulukus, Sennur Akar, Nail |
| contents | We develop a novel framework for fully decentralized offloading policy design in multi-access edge computing (MEC) systems. The system comprises $N$ power-constrained user equipments (UEs) assisted by an edge server (ES) to process incoming tasks. Tasks are labeled with urgency flags, and in this paper, we classify them under three urgency levels, namely, high, moderate, and low urgency. We formulate the problem of designing computation decisions for the UEs within a large population noncooperative game framework, where each UE selfishly decides on how to split task execution between its local onboard processor and the ES. We employ the weighted average age of information (AoI) metric to quantify information freshness at the UEs. Increased onboard processing consumes more local power, while increased offloading may potentially incur a higher average AoI due to other UEs' packets being offloaded to the same ES. Thus, we use the mean-field game (MFG) formulation to compute approximate decentralized Nash equilibrium offloading and local computation policies for the UEs to balance between the information freshness and local power consumption. Finally, we provide a projected gradient descent-based algorithm to numerically assess the merits of our approach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_05660 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Fully Decentralized Computation Offloading in Priority-Driven Edge Computing Systems Aggarwal, Shubham Bastopcu, Melih Zaman, Muhammad Aneeq uz Başar, Tamer Ulukus, Sennur Akar, Nail Information Theory Computer Science and Game Theory Systems and Control We develop a novel framework for fully decentralized offloading policy design in multi-access edge computing (MEC) systems. The system comprises $N$ power-constrained user equipments (UEs) assisted by an edge server (ES) to process incoming tasks. Tasks are labeled with urgency flags, and in this paper, we classify them under three urgency levels, namely, high, moderate, and low urgency. We formulate the problem of designing computation decisions for the UEs within a large population noncooperative game framework, where each UE selfishly decides on how to split task execution between its local onboard processor and the ES. We employ the weighted average age of information (AoI) metric to quantify information freshness at the UEs. Increased onboard processing consumes more local power, while increased offloading may potentially incur a higher average AoI due to other UEs' packets being offloaded to the same ES. Thus, we use the mean-field game (MFG) formulation to compute approximate decentralized Nash equilibrium offloading and local computation policies for the UEs to balance between the information freshness and local power consumption. Finally, we provide a projected gradient descent-based algorithm to numerically assess the merits of our approach. |
| title | Fully Decentralized Computation Offloading in Priority-Driven Edge Computing Systems |
| topic | Information Theory Computer Science and Game Theory Systems and Control |
| url | https://arxiv.org/abs/2501.05660 |