Fundamental Limits of Covert queueing under Busy-Period Observations
Abstract
Consider a queueing system operated by Bob, which is intended to serve only jobs generated by a legitimate user, Willie. Willie's jobs arrive according to a Poisson process, and the service times are exponentially distributed. Bob seeks to covertly serve additional jobs arriving according to an independent Poisson process, without Willie detecting their presence. As the legitimate user, Willie is provided with certain statistics of each busy period by Bob. In particular, we consider two statistics: (i) the number of jobs served during each busy period and (ii) the duration of each busy period. We establish that, under either statistic, the maximum expected number of additional jobs that Bob can covertly serve obeys a square-root law. Specifically, over n busy periods, Bob can covertly serve additional jobs in the order of square root of n, whereas any scaling which is above square root of n enables Willie to asymptotically detect the presence of these additional jobs with vanishing error probability. Furthermore, we characterize the scaling constant associated with the square-root law, which we refer to as the covert queueing constant, for each of the two statistics. We compare the scaling constants corresponding to the two statistics and argue that the scaling constant under statistic (i) is no greater than that under statistic (ii).
Related
- The Fundamental Limits of Structure-Agnostic Functional Estimation
- Fundamental limits on photonic state preparation from phase-space majorization
- Data Center Oscillation Isolation and Grid Support: Fundamental Limits and Source-Selective Control
- Fundamental Limits of Sequence Reconstruction Problems in Immunogenomics
- Fundamental Limits of Quantized MIMO ISAC under Gaussian Signaling
BibTeX
@misc{sahithi2026fundamental,
title = {{Fundamental Limits of Covert queueing under Busy-Period Observations}},
author = {Anumula Venkata Sai Sree Sahithi and Arti Yardi and Jithin Ravi},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.13911},
eprint = {2610.13911},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.13911},
}
RIS
TY - UNPB
TI - Fundamental Limits of Covert queueing under Busy-Period Observations
AU - Anumula Venkata Sai Sree Sahithi
AU - Arti Yardi
AU - Jithin Ravi
PY - 2026
DA - 2026/10/09
PB - arXiv
DO - 10.48550/arxiv.2610.13911
UR - https://arxiv.org/abs/2610.13911
AB - Consider a queueing system operated by Bob, which is intended to serve only jobs generated by a legitimate user, Willie. Willie's jobs arrive according to a Poisson process, and the service times are exponentially distributed. Bob seeks to covertly serve additional jobs arriving according to an independent Poisson process, without Willie detecting their presence. As the legitimate user, Willie is provided with certain statistics of each busy period by Bob. In particular, we consider two statistics: (i) the number of jobs served during each busy period and (ii) the duration of each busy period. We establish that, under either statistic, the maximum expected number of additional jobs that Bob can covertly serve obeys a square-root law. Specifically, over n busy periods, Bob can covertly serve additional jobs in the order of square root of n, whereas any scaling which is above square root of n enables Willie to asymptotically detect the presence of these additional jobs with vanishing error probability. Furthermore, we characterize the scaling constant associated with the square-root law, which we refer to as the covert queueing constant, for each of the two statistics. We compare the scaling constants corresponding to the two statistics and argue that the scaling constant under statistic (i) is no greater than that under statistic (ii).
ER -