An official website of the United States government
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.
more »
« less
This content will become publicly available on November 24, 2025
Timely Offloading in Mobile Edge Cloud Systems
Future real-time applications like smart cities will use complex Machine Learning (ML) models for a variety of tasks. Timely status information is required for these applications to be reliable. Offloading computation to a mobile edge cloud (MEC) can reduce the completion time of these tasks. However, using the MEC may come at a cost such as related to use of a cloud service or privacy. In this paper, we consider a source that generates time-stamped status updates for delivery to a monitor after processing by the mobile device or MEC. We study how a scheduler must forward these updates to achieve timely updates at the monitor but also limit MEC usage. We measure timeliness at the monitor using the age of information (AoI) metric. We formulate this problem as an infinite horizon Markov decision process (MDP) with an average cost criterion. We prove that an optimal scheduling policy has an age-threshold structure that depends on how long an update has been in service.
more »
« less
- Award ID(s):
- 2148104
- PAR ID:
- 10586389
- Publisher / Repository:
- IEEE
- Date Published:
- ISBN:
- 979-8-3503-4893-4
- Page Range / eLocation ID:
- 133 to 138
- Format(s):
- Medium: X
- Location:
- Shenzhen, China
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Age of information has been proposed recently to measure information freshness, especially for a class of real-time video applications. These applications often demand timely updates with edge cloud computing to guarantee the user experience. However, the edge cloud is usually equipped with limited computation and network resources and therefore, resource contention among different video streams can contribute to making the updates stale. Aiming to minimize a penalty function of the weighted sum of the average age over multiple end users, this paper presents a greedy traffic scheduling policy for the processor to choose the next processing request with the maximum immediate penalty reduction. In this work, we formulate the service process when requests from multiple users arrive at edge cloud servers asynchronously and show that the proposed greedy scheduling algorithm is the optimal work- conserving policy for a class of age penalty functions.more » « less
-
null (Ed.)Age of information has been proposed recently to measure information freshness, especially for a class of real-time video applications. These applications often demand timely updates with edge cloud computing to guarantee the user experience. However, the edge cloud is usually equipped with limited computation and network resources and therefore, resource contention among different video streams can contribute to making the updates stale. Aiming to minimize a penalty function of the weighted sum of the average age over multiple end users, this paper presents a greedy traffic scheduling policy for the processor to choose the next processing request with the maximum immediate penalty reduction. In this work, we formulate the service process when requests from multiple users arrive at edge cloud servers asynchronously and show that the proposed greedy scheduling algorithm is the optimal work-conserving policy for a class of age penalty functions.more » « less
-
A source submits status update jobs to a service fa- cility for processing and delivery to a monitor. The status updates belong to service classes with different service requirements. We model the service requirements using a hyperexponential service time model. To avoid class-specific bias in the service process, the system implements an M/G/1/1 blocking queue; new arrivals are discarded if the server is busy. Using an age-of-information (AoI) metric to characterize timeliness of the updates, a stochastic hybrid system (SHS) approach is employed to derive the overall average AoI and the average AoI for each service class. We observe that both the overall AoI and class-specific AoI share a common penalty that is a function of the second moment of the average service time and they differ chiefly because of their different arrival rates. We show that each high-probability service class has an associated age-optimal update arrival rate while low- probability service classes incur an average age that is always decreasing in the update arrival rate.more » « less
-
In the era of pervasive digital connectivity, intelligent surveillance systems (ISS) have become essential tools for ensuring public safety, protecting critical infrastructure, and deterring security threats in various environments. The current state of these systems heavily relies on the computational capabilities of mobile devices for tasks such as real-time video analysis, object detection, and tracking. However, the limited processing power and energy constraints of these devices hinder their ability to perform these tasks efficiently and effectively. The dynamic nature of the surveillance environment also adds complexity to the task-offloading process. To address this issue, mobile edge computing (MEC) comes into play by offering edge servers with higher computational capabilities and proximity to mobile devices. It enables ISS by offloading computationally intensive tasks from resource-constrained mobile devices to nearby MEC servers. Therefore, in this paper, we propose and implement an energy-efficient and cost-effective task-offloading framework in the MEC environment. The amalgamation of binary and partial task-offloading strategies is used to achieve a cost-effective and energy-efficient system. We also compare the proposed framework in MEC with mobile cloud computing (MCC) environments. The proposed framework addresses the challenge of achieving energy-efficient and cost-effective solutions in the context of MEC for ISS. The iFogSim simulator is used for implementation and simulation purposes. The simulation results show that the proposed framework reduces latency, cost, execution time, network usage, and energy consumption.more » « less
