2020/01/19 by Jaya Prakash Champati, Champati, Jaya Prakash, Ramana R. Avula +5
Computer Science · Engineering · Psychology · #Age of Information Optimization #Cognitive Functions and Memory #FOS: Computer and information sciences #Information Retrieval (cs.IR) #Information Theory (cs.IT) #IoT Networks and Protocols
paper · pdf · doi:10.48550/arxiv.2001.06831
openalex publication_date 2020/01/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
There is a growing interest in analysing the freshness of data in networked\nsystems. Age of Information (AoI) has emerged as a popular metric to quantify\nthis freshness at a given destination. There has been a significant research\neffort in optimizing this metric in communication and networking systems under\ndifferent settings. In contrast to previous works, we are interested in a\nfundamental question, what is the minimum achievable AoI in any\nsingle-server-single-source queuing system for a given service-time\ndistribution? To address this question, we study a problem of optimizing AoI\nunder service preemptions. Our main result is on the characterization of the\nminimum achievable average peak AoI (PAoI). We obtain this result by showing\nthat a fixed-threshold policy is optimal in the set of all randomized-threshold\ncausal policies. We use the characterization to provide necessary and\nsufficient conditions for the service-time distributions under which\npreemptions are beneficial.\n