HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Covert Cycle Stealing in a Single FIFO Server (extended version)

Bo Jiang 1 Philippe Nain 2 Don Towsley 3
2 DANTE - Dynamic Networks : Temporal and Structural Capture Approach
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme, IXXI - Institut Rhône-Alpin des systèmes complexes
Abstract : Consider a setting where Willie generates a Poisson stream of jobs and routes them to a single server that follows the first-in first-out discipline. Suppose there is an adversary Alice, who desires to receive service without being detected. We ask the question: what is the amount of service that she can receive covertly, i.e. without being detected by Willie? In the case where both Willie and Alice jobs have exponential service times with respective rates $µ 1$ and $µ 2$ , we demonstrate a phase-transition when Alice adopts the strategy of inserting a single job probabilistically when the server idles : over n busy periods, she can achieve a covert throughput of $O(√ n$) when $µ 1 < 2µ 2$ , $O(n/ log n)$ when $µ 1 = 2µ 2$ , and $O(n µ2/µ1)$ when $µ 1 > 2µ 2$. When both Willie and Alice jobs have general service times we establish an upper bound for the amount of service Alice can get covertly. This bound is related to the Fisher information. Additional upper bounds are obtained for more general insertion policies.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Contributor : Philippe Nain Connect in order to contact the contributor
Submitted on : Tuesday, May 4, 2021 - 2:31:50 PM
Last modification on : Tuesday, May 17, 2022 - 2:34:26 PM


Files produced by the author(s)


  • HAL Id : hal-02497557, version 3


Bo Jiang, Philippe Nain, Don Towsley. Covert Cycle Stealing in a Single FIFO Server (extended version). 2021. ⟨hal-02497557v3⟩



Record views


Files downloads