Age-of-Information in the Presence of Error

Abstract

We consider the peak age-of-information (PAoI) in an M/M/1 queueing system with packet delivery error, i.e., update packets can get lost during transmissions to their destination. We focus on two types of policies, one is to adopt Last-Come-First-Served (LCFS) scheduling, and the other is to utilize retransmissions, i.e., keep transmitting the most recent packet. Both policies can effectively avoid the queueing delay of a busy channel and ensure a small PAoI. Exact PAoI expressions under both policies with different error probabilities are derived, including First-Come-First-Served (FCFS), LCFS with preemptive priority, LCFS with non-preemptive priority, Retransmission with preemptive priority, and Retransmission with non-preemptive priority. Numerical results obtained from analysis and simulation are presented to validate our results.

arXiv comment8 pages, 3 figures

References in corpus (1)

• Update or Wait: How to Keep Your Data Fresh

Cited by in corpus (8)

• Age of Information for Discrete Time Queues
• Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks
• Can Determinacy Minimize Age of Information?
• Update or Wait: How to Keep Your Data Fresh
• ACP: An End-to-End Transport Protocol for Delivering Fresh Updates in the Internet-of-Things
• Benefits of Coding on Age of Information in Broadcast Networks
• To Skip or to Switch? Minimizing Age of Information under Link Capacity Constraint
• Optimal Status Update for Age of Information Minimization with an Energy Harvesting Source