2016 · 31 citations · 16 references
ComputingComputer SystemsSystems EngineeringComputer NetworksDistributed SystemsQueuing TheoryBuffer ManagementCaching StrategiesLatency OptimizationNetwork Information TheoryNetwork ProtocolsQueueing TheoryLatency TradeoffsNetwork Throughput OptimizationThroughputThroughput ImprovementWireless Networking
Data freshness, or age‑of‑information, measures how long it has been since the newest packet arrived, and while dropping stale packets can reduce age, many applications require all packets to be delivered, so age must be optimized without throughput loss. The study aims to design multi‑server information‑update systems that optimize age‑of‑information while preserving throughput. The authors analyze a general multi‑server update model with unordered packet arrivals, treating each server as a wireless channel. A preemptive Last Generated First Served policy is proven to simultaneously optimize age, throughput, and delay for both infinite and finite buffers, and this age‑optimality holds under arbitrary, even non‑stationary, arrival processes.
In this work, we investigate the design of information-update systems, where incoming update packets are forwarded to a remote destination through multiple servers (each server can be viewed as a wireless channel). One important performance metric of these systems is the data freshness at the destination, also called the age-of-information or simply age, which is defined as the time elapsed since the freshest packet at the destination was generated. Recent studies on information-update systems have shown that the age-of-information can be reduced by intelligently dropping stale packets. However, packet dropping may not be appropriate in many applications, such as news and social updates, where users are interested in not just the latest updates, but also past news. Therefore, all packets may need to be successfully delivered. In this paper, we study how to optimize age-of-information without throughput loss. We consider a general scenario where incoming update packets do not necessarily arrive in the order of their generation times. We prove that a preemptive Last Generated First Served (LGFS) policy simultaneous optimizes the age, throughput, and delay performance in infinite buffer queueing systems. We also show age-optimality for the LGFS policy for any finite queue size. These results hold for arbitrary, including non-stationary, arrival processes.
16
Reinforcement Learning: An Introduction
IEEE Transactions on Neural Networks · 2005 · 25.8K citations
Real-time status: How often should one update?
Sanjit K. Kaul, Roy D. Yates, Marco Gruteser · 2012 · 2.4K citations
Sanjit K. Kaul, Roy D. Yates, Marco Gruteser · 2012 · 472 citations
Lazy is timely: Status updates by an energy harvesting source
Roy D. Yates · 2015 · 425 citations
Real-time status updating: Multiple sources
Roy D. Yates, Sanjit K. Kaul · 2012 · 361 citations