Age of information with packet management

By Maice Costa, Marian Codreanu, Anthony Ephremides. 2014 IEEE International Symposium on Information Theory, 2014

324 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering, Epidemiology

View Paper: https://www.semanticscholar.org/paper/eb38626e922fc342128cbe3a04135a826c4e7dd9

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

In Epidemiology

Citations in the corpus

On the Age of Information in Status Update Systems With Packet Management (2015, result): “Part of the results have been presented in [6].”
Age of Information: An Introduction and Survey (2020, methodology): “These strategies, identified as packet management [18], [19], include the M/M/1/1 queue that blocks and clears a new arrival while the server is busy, the M/M/1/2 queue that will queue one waiting packet but blocks an arrival when the waiting space is occupied, and the M/M/1/2∗ queue that will preem”
Optimal Status Update for Age of Information Minimization With an Energy Harvesting Source (2017, background): “A related metric, Peak Age of Information (PAoI), is introduced in [12] and [13], and has”
Optimizing age-of-information in a multi-class queueing system (2015, methodology): “This can be viewed as the server is performing packet management [9].”
Update or wait: How to keep your data fresh (2016, unknown): “In [6], it was found that a good policy is to discard the old packets waiting in the queue if a new sample arrives, which can greatly reduce the impact of queueing delay.”
Age of Information: A New Concept, Metric, and Tool (2018, methodology): “Finally, a new performance metric called Peak Age of Information introduced in [11] is presented.”
The Age of Information: Real-Time Status Updating by Multiple Sources (2016, background): “[14], [15] analyzed AoI and PAoI for M/M/1/1 and M/M/1/2 queues that discard arriving updates if the system is full and also for a third queue, dubbed M/M/1/2*, in which an arriving update would preempt a waiting update.”