Scheduling to Minimize Age of Information With Multiple Sources

Finding an optimal/near-optimal scheduling algorithm to minimize the age of information (AoI) in a multi-source G/G/1 system is well-known to be a hard problem, more so if there is a transmission (energy) cost. In this paper, we consider a multi-source G/G/1 system and the goal is to minimize a weig...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE journal on selected areas in information theory Ročník 4; s. 539 - 550
Hlavní autoři: Saurav, Kumar, Vaze, Rahul
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Age of information
Algorithms
competitive ratio
Costs
Energy costs
Monitoring
Optimal scheduling
Preempting
Scheduling
Scheduling algorithms
Stochastic processes
Upper bound
ISSN:2641-8770, 2641-8770
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Finding an optimal/near-optimal scheduling algorithm to minimize the age of information (AoI) in a multi-source G/G/1 system is well-known to be a hard problem, more so if there is a transmission (energy) cost. In this paper, we consider a multi-source G/G/1 system and the goal is to minimize a weighted sum of the AoI of all sources, subject to an energy cost constraint. We propose a novel doubly randomized non-preemptive scheduling algorithm and show that in the non-preemptive setting, where an update under transmission cannot be preempted, the competitive ratio of the proposed algorithm is at most 3 plus the maximum of the ratio of the variance and the mean of the update inter-generation time distribution of sources. Notably, the competitive ratio is independent of the number of sources, or their service time distributions, and is at most 4 for several common update inter-generation time distributions such as exponential, uniform and Rayleigh. For preemptive setting, where an update under transmission can be preempted, we consider a multi-source G/M/1 system and show that the proposed non-preemptive algorithm has competitive ratio at most 5 plus the maximum of the ratio of the variance and the mean of the update inter-generation time distribution of sources.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2641-8770
2641-8770
DOI:10.1109/JSAIT.2023.3322077