The value of preemption and observability in time-varying channels

We study the problem of scheduling packets on communication channels whose service availability is modeled by independent Gilbert–Elliot (ON,OFF) Markov chains. Classical models assume that channel states are always known to the scheduler and that transmission is perfect for ON channels. We consider the often more realistic problem of non-preemptive scheduling on imperfect and unobservable channels. In particular, in our model, ON channels have a nonzero probability of unsuccessful transmission, the state of the channel is only observed upon successful transmission, and once a channel is activated, it must remain active until successful transmission. We give conditions under which simple policies are optimal. We also investigate the performance impact of not being able to preempt and of not having access to channel information. Combining known and novel results, we characterize the “Preemption Gain” and “Observability Gain.” Numerically, we show that these gains can be significant, highlighting the critical value of channel state information and preemption, and providing insight into the possible benefit of redesigning systems to permit preemption and/or to provide state information in communication channels.

Authors

Institutions

Publication Details

Journal
Probability in the Engineering and Informational Sciences
Published
2026-10-09
DOI
https://doi.org/10.1017/s0269964826100382
Primary Topic
Age of Information Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The value of preemption and observability in time-varying channels

Urtzi Ayesta, Thomas Hira, Rhonda Righter, Verloop, Ina, Maria
Probability in the Engineering and Informational Sciences
Age of Information Optimization
article

The value of preemption and observability in time-varying channels

Urtzi Ayesta, Thomas Hira, Rhonda Righter, Verloop, Ina, Maria
article en

Abstract

We study the problem of scheduling packets on communication channels whose service availability is modeled by independent Gilbert–Elliot (ON,OFF) Markov chains. Classical models assume that channel states are always known to the scheduler and that transmission is perfect for ON channels. We consider the often more realistic problem of non-preemptive scheduling on imperfect and unobservable channels. In particular, in our model, ON channels have a nonzero probability of unsuccessful transmission, the state of the channel is only observed upon successful transmission, and once a channel is activated, it must remain active until successful transmission. We give conditions under which simple policies are optimal. We also investigate the performance impact of not being able to preempt and of not having access to channel information. Combining known and novel results, we characterize the “Preemption Gain” and “Observability Gain.” Numerically, we show that these gains can be significant, highlighting the critical value of channel state information and preemption, and providing insight into the possible benefit of redesigning systems to permit preemption and/or to provide state information in communication channels.

Probability in the Engineering and Informational Sciences
University of the Basque Country (ES), Université de Toulouse (FR), University of California, Berkeley (US)
Openalex Percentile: Top 11%
Age of Information Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.