When to Preempt in a Status Update System?

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Banerjee, Subhankar, Ulukus, Sennur
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866911880543469568
author Banerjee, Subhankar
Ulukus, Sennur
author_facet Banerjee, Subhankar
Ulukus, Sennur
contents We consider a time-slotted status update system with an error-free preemptive queue. The goal of the sampler-scheduler pair is to minimize the age of information at the monitor by sampling and transmitting the freshly sampled update packets to the monitor. The sampler-scheduler pair also has a choice to preempt an old update packet from the server and transmit a new update packet to the server. We formulate this problem as a Markov decision process (MDP) and find the optimal sampling policy. We find a sufficient, and also separately a necessary, condition for the always preemption policy to be an optimal policy. We show that it is optimal for the sampler-scheduler pair to sample a new packet immediately upon the reception of an update packet at the monitor. We propose a double-threshold sampling policy which we show to be an optimal policy under some assumptions on the queue statistic.
format Preprint
id arxiv_https___arxiv_org_abs_2402_00845
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle When to Preempt in a Status Update System?
Banerjee, Subhankar
Ulukus, Sennur
Information Theory
Computer Science and Game Theory
Networking and Internet Architecture
Systems and Control
Signal Processing
We consider a time-slotted status update system with an error-free preemptive queue. The goal of the sampler-scheduler pair is to minimize the age of information at the monitor by sampling and transmitting the freshly sampled update packets to the monitor. The sampler-scheduler pair also has a choice to preempt an old update packet from the server and transmit a new update packet to the server. We formulate this problem as a Markov decision process (MDP) and find the optimal sampling policy. We find a sufficient, and also separately a necessary, condition for the always preemption policy to be an optimal policy. We show that it is optimal for the sampler-scheduler pair to sample a new packet immediately upon the reception of an update packet at the monitor. We propose a double-threshold sampling policy which we show to be an optimal policy under some assumptions on the queue statistic.
title When to Preempt in a Status Update System?
topic Information Theory
Computer Science and Game Theory
Networking and Internet Architecture
Systems and Control
Signal Processing
url https://arxiv.org/abs/2402.00845