Основні поняття
The core message of this article is to determine the optimal scheduling policy to minimize the average peak age of information (PAoI) in mobile edge computing (MEC) systems, considering both transmission and computation times. The authors analyze two edge server setups: computing preemption, where a new packet can preempt the current computing process, and non-preemption, where a new packet has to wait until the current one completes computing.
Анотація
The article focuses on optimizing the average peak age of information (PAoI) in mobile edge computing (MEC) systems, where a source generates update packets and transmits them to an edge server for computation before delivery to a destination. The authors consider two edge server configurations: computing preemption and non-preemption.
Key highlights:
- In the non-preemptive system, the authors prove that the optimal policy is a fixed threshold policy, where the source submits a new packet after a constant time threshold or after the current packet's computation is complete, whichever comes first.
- In the preemptive system, the authors show that a transmission-aware threshold policy is optimal when the computation time follows an exponential distribution. The threshold is inversely proportional to the transmission time of the last packet.
- The numerical results demonstrate that preemptive systems are not always superior to non-preemptive systems, even with exponential distributions. The optimal threshold increases in preemptive systems but decreases in non-preemptive systems as the ratio of mean transmission time to mean computation time increases.
Статистика
The mean transmission time and computation time are given by E[T] = 1/λ and E[C] = 1/μ, respectively.