Yin Sun

TL;DR: In this paper, the authors study how to optimally manage the freshness of information updates sent from a source node to a destination via a channel and develop efficient algorithms to find the optimal update policy among all causal policies and establish sufficient and necessary conditions for the optimality of the zero-wait policy.

TL;DR: The current state of the art in the design and optimization of low-latency cyberphysical systems and applications in which sources send time-stamped status updates to interested recipients is described and AoI timeliness metrics are described.

TL;DR: In this paper, it was shown that a preemptive Last Generated First Served (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy.

TL;DR: In this article, a preemptive Last Generated First Served (LGFS) policy was proposed to optimize the age of updates without throughput loss in information-update systems, where incoming updates do not necessarily arrive in the order of their generation times.

TL;DR: In this paper, the authors summarize recent contributions in the broad area of AoI and present general AoI evaluation analysis that are applicable to a wide variety of sources and systems, starting from elementary single-server queues, and applying these AoI methods to a range of increasingly complex systems, including energy harvesting sensors transmitting over noisy channels, parallel server systems, queueing networks, and various single-hop and multi-hop wireless networks.