In cloud status updates with i.i.d. random service times, the optimal deterministic policy minimizing long-run average AoI uses a threshold on current age to decide when to upload and a fixed cutoff to preempt long computations, with preemption outperforming waiting for exponential services.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Timely Cloud Computing: Preemption and Waiting
In cloud status updates with i.i.d. random service times, the optimal deterministic policy minimizing long-run average AoI uses a threshold on current age to decide when to upload and a fixed cutoff to preempt long computations, with preemption outperforming waiting for exponential services.