EUVIMEDEUVIMED entdecken
Crossref

AoI Minimization for Computation‐Intensive Tasks at the Edge: The Pareto‐Optimal Based Packet Scheduling Algorithm

Shihao Li, Bohao Chen, Shihan Zhou, Yuan Chai, Yiqing Li, Quan Chen

Concurrency and Computation: Practice and Experience · 2026-11 · 38 (22)

DOI: 10.1002/cpe.71007 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Concurrency and Computation: Practice and Experience, online erschienen am 09.11.2026. Verfasst von Shihao Li und 5 weiteren Autor:innen. Die Arbeit nennt 32 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Basic and Applied Basic Research Foundation of Guangdong Province.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Age of information (AoI), which is defined as the time elapsed since the generation of the latest received update, has drawn growing research attention recently. To optimize the system AoI for computation‐intensive tasks, most existing work either follows simple queuing disciplines or works in an offline manner. Thus, in this paper, we investigate how to minimize the system AoI by taking into account both the freshness of the arrival packets and the computation load of future packets. First, we identify the existence of the Pareto‐optimal frontier for packet scheduling for the first time, which is obtained by defining two auxiliary attributes related to the freshness and the computation load of packets. Second, considering the possible future arrivals, we decompose the problem of AoI minimization into the subproblems of minimizing the possible incurred AoI at each epoch. Then, an efficient Pareto‐optimal packet scheduling method is proposed to minimize the incurred AoI with the selected packets. The proposed method is proven to have an approximation ratio of 5/3. Additionally, to further improve the performance, a Pareto‐optimal packet scheduling method with a retention mechanism is also proposed, which incorporates a candidate packet retention mechanism to dynamically maintain a queue of high‐quality candidate packets, considering the randomness of future packet arrivals. Finally, the theoretical analysis and simulation results verify that the proposed algorithm has high performance in terms of AoI, reducing the AoI by up to 12.6%.

Förderung

  • National Natural Science Foundation of China
  • Basic and Applied Basic Research Foundation of Guangdong Province

Zitieren

APA

Li, S., Chen, B., Zhou, S., Chai, Y., Li, Y., & Chen, Q. (2026). AoI Minimization for Computation‐Intensive Tasks at the Edge: The Pareto‐Optimal Based Packet Scheduling Algorithm. Concurrency and Computation: Practice and Experience, 38(22). https://doi.org/10.1002/cpe.71007

Vancouver

Li S, Chen B, Zhou S, Chai Y, Li Y, Chen Q. AoI Minimization for Computation‐Intensive Tasks at the Edge: The Pareto‐Optimal Based Packet Scheduling Algorithm. Concurrency and Computation: Practice and Experience. 2026;38(22). doi:10.1002/cpe.71007

BibTeX
@article{Li2026,
  author = {Li, Shihao and Chen, Bohao and Zhou, Shihan and Chai, Yuan and Li, Yiqing and Chen, Quan},
  title = {AoI Minimization for Computation‐Intensive Tasks at the Edge: The Pareto‐Optimal Based Packet Scheduling Algorithm},
  journal = {Concurrency and Computation: Practice and Experience},
  year = {2026},
  volume = {38},
  number = {22},
  doi = {10.1002/cpe.71007}
}
Kostenlos starten →