Age of Information with Age-Dependent Server Selection
Nail Akar, Ismail Cosandal, Sennur Ulukus

TL;DR
This paper develops an age-dependent server selection policy for multi-server status update systems with heterogeneous service times, optimizing AoI and transmission costs using a novel Markov chain framework.
Contribution
It introduces the multi-regime absorbing Markov chain (MR-AMC) method for exact AoI distribution analysis and designs optimal multi-threshold policies for heterogeneous servers.
Findings
Age-dependent server selection reduces average AoI.
The MR-AMC method provides exact AoI distribution for complex systems.
Optimal thresholds improve performance under cost constraints.
Abstract
In this paper, we consider a single-source multi-server generate-at-will discrete-time non-preemptive status update system where update packets are transmitted using {\em only one} of the available servers, according to a server selection policy. In particular, when a transmission is complete, the update system makes a threshold-based decision on whether to wait or transmit, and if latter, which server to use for transmissions, on the basis of the instantaneous value of the age of information (AoI) process. In our setting, servers have general heterogeneous discrete phase-type (DPH) distributed service times, and also heterogeneous transmission costs. The goal is to find an age-dependent multi-threshold policy that minimizes the AoI cost with a constraint on transmission costs, the former cost defined in terms of the time average of an arbitrary function of AoI. For this purpose, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAge of Information Optimization · IoT and Edge/Fog Computing · Caching and Content Delivery
