Mathematics > Probability
[Submitted on 11 Mar 2020 (v1), last revised 4 May 2021 (this version, v3)]
Title:Covert Cycle Stealing in a Single FIFO Server
View PDFAbstract: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 $\mu_1$ and $\mu_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 $\mathcal{O}(\sqrt{n})$ when $\mu_1 < 2\mu_2$, $\mathcal{O}(\sqrt{n/\log n})$ when $\mu_1 = 2\mu_2$, and $\mathcal{O}(n^{\mu_2/\mu_1})$ when $\mu_1 > 2\mu_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.
Submission history
From: Bo Jiang [view email][v1] Wed, 11 Mar 2020 06:34:12 UTC (42 KB)
[v2] Sun, 7 Feb 2021 02:18:56 UTC (48 KB)
[v3] Tue, 4 May 2021 12:54:10 UTC (46 KB)
Current browse context:
math.PR
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
Connected Papers (What is Connected Papers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.