Timely Cloud Computing: Preemption and Waiting
Authors:
- 1 September 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 528-535
Abstract
The notion of timely status updating is investigated in the context of cloud computing. Measurements of a time-varying process of interest are acquired by a sensor node, and uploaded to a cloud server to undergo some required computations. These computations have random service times that are independent and identically distributed across different uploads. After the computations are done, the results are delivered to a monitor, constituting an update. The goal is to keep the monitor continuously fed with fresh updates over time, which is assessed by an age-of-information(AoI) metric. A scheduler is employed to optimize the measurement acquisition times. Following an update, an idle waiting period may be imposed by the scheduler before acquiring a new measurement. The scheduler also has the capability to preempt a measurement in progress if its service time grows above a certain cutoff time, and upload a fresher measurement in its place. Focusing on stationary deterministic policies, in which waiting times are deterministic functions of the instantaneous AoI and the cutoff time is fixed for all uploads, it is shown that the optimal waiting policy that minimizes the long term average AoI has a threshold structure, in which a new measurement is uploaded following an update only if the AoI grows above a certain threshold that is a function of the service time distribution and the cutoff time. The optimal cutoff is then found for standard and shifted exponential service times. While it has been previously reported that waiting before updating can be beneficial for AoI, it is shown in this work that preemption of late updates can be even more beneficial.Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Optimal Status Update for Age of Information Minimization With an Energy Harvesting SourceIEEE Transactions on Green Communications and Networking, 2017
- Update or Wait: How to Keep Your Data FreshIEEE Transactions on Information Theory, 2017
- Timely updates over an erasure channel2017
- Timely cloud gaming2017
- Age-of-information in the presence of error2016
- On the Age of Information in Status Update Systems With Packet ManagementIEEE Transactions on Information Theory, 2016
- Age of information under random updates2013
- Status updates through queues2012
- Convex Optimization2004
- On Nonlinear Fractional ProgrammingManagement Science, 1967