Accéder directement au contenu Accéder directement à la navigation
Pré-publication, Document de travail

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

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.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées

https://hal.inria.fr/hal-02497557
Contributeur : Philippe Nain <>
Soumis le : samedi 6 février 2021 - 20:21:59
Dernière modification le : mercredi 5 mai 2021 - 03:38:46

Fichier

arxiv2-main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-02497557, version 2

Collections

Citation

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

Partager

Métriques

Consultations de la notice

44

Téléchargements de fichiers

148