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

Podrobná bibliografia

Vydané v:	IEEE journal on selected areas in information theory Ročník 4; s. 539 - 550
Hlavní autori:	Saurav, Kumar, Vaze, Rahul
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Piscataway IEEE 2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!