Statistical Guarantee Optimization for AoI in Single-Hop and Two-Hop Systems with Periodic Arrivals

Abstract

Age of Information (AoI) has proven to be a useful metric in networked systems where timely information updates are of importance. In the literature, minimizing "average age" has received considerable attention. However, various applications pose stricter age requirements on the updates which demand knowledge of the AoI distribution. Furthermore, the analysis of AoI distribution in a multi-hop setting, which is important for the study of Wireless Networked Control Systems (WNCS), has not been addressed before. Toward this end, we study the distribution of AoI in a WNCS with two hops and devise a problem of minimizing the tail of the AoI distribution with respect to the frequency of generating information updates, i.e., the sampling rate of monitoring a process, under first-come-first-serve (FCFS) queuing discipline. We argue that computing an exact expression for the AoI distribution may not always be feasible; therefore, we opt for computing upper bounds on the tail of the AoI distribution. Using these upper bounds we formulate Upper Bound Minimization Problems (UBMP), namely, Chernoff-UBMP and alpha-relaxed Upper BoundMinimization Problem (alpha-UBMP), where alpha > 1 is an approximation factor, and solve them to obtain "good" heuristic rate solutions. We demonstrate the efficacy of our approach by solving the proposed UBMPs for three service distributions: geometric, exponential, and Erlang. Simulation results show that the rate solutions obtained are near-optimal for minimizing the tail of the AoI distribution for the considered distributions.

arXiv commentPublished in IEEE Transactions on Communications. This is an extension to the following workshop paper for two-hop and N-hop scenarios. J. P. Champati, H. Al-Zubaidy, and J. Gross, "Statistical guarantee optimization for age of information for the DG1 queue", in Proc. IEEE INFOCOM Workshops, April 2018, pp. 130-135

References in corpus (4)

• A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues
• Can Determinacy Minimize Age of Information?
• Age of Information in G/G/1/1 Systems: Age Expressions, Bounds, Special Cases, and Optimization
• Age of Information in Multihop Multicast Networks

Cited by in corpus (7)

• Optimized Age of Information Tail for Ultra-Reliable Low-Latency Communications in Vehicular Networks
• Statistical Age-of-Information Optimization for Status Update over Multi-State Fading Channels
• How should the server sleep? -- Age-energy tradeoff in sleep-wake server systems
• Exact Analytical Model of Age of Information in Multi-source Status Update Systems with Per-source Queueing
• Information Freshness of Updates Sent over LEO Satellite Multi-Hop Networks
• Optimizing Information Freshness in Two-Hop Status Update Systems under a Resource Constraint
• Towards Deterministic Communications in 6G Networks: State of the Art, Open Challenges and the Way Forward