Covert Cycle Stealing in a Single FIFO Server - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Modeling and Performance Evaluation of Computing Systems Year : 2021

Covert Cycle Stealing in a Single FIFO Server

Bo Jiang
  • Function : Author
  • PersonId : 1097788
Don Towsley
  • Function : Author
  • PersonId : 1097789

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 number of jobs 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, measured by the expected number of jobs covertly inserted, 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 number of jobs Alice can execute covertly. This bound is related to the Fisher information. More general insertion policies are also discussed.
Fichier principal
Vignette du fichier
main.pdf (473.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03216762 , version 1 (04-05-2021)

Identifiers

Cite

Bo Jiang, Philippe Nain, Don Towsley. Covert Cycle Stealing in a Single FIFO Server. ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2021, 6 (2), pp.1-33. ⟨10.1145/3462774⟩. ⟨hal-03216762⟩
34 View
62 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More