单台FIFO服务器中的隐蔽周期窃取
Covert Cycle Stealing in a Single FIFO Server
摘要：
考虑这样一种设置：Willie生成一个泊松作业流，并将它们路由到遵循先进先出原则的单个服务器。假设有一个对手爱丽丝，她希望在不被发现的情况下接受服务。我们提出这样一个问题：她可以秘密地接受多少工作，也就是说，不被威利发现？在Willie和Alice作业都具有指数服务时间的情况下，其速率分别为$μ_1$和$μ_2$，当Alice采用在服务器空闲时概率性地插入单个作业的策略时，我们演示了一个相变：在$n$繁忙期间，她可以实现隐蔽吞吐量，该吞吐量由隐蔽插入的作业的预期数量来测量，当$μ_1 < 2μ_2$时，$\mathcal{O}(\sqrt{n})$，当$μ_1 = 2μ_2$时，$\mathcal{O}(\sqrt{n/\log n})$，和$\mathcal{O}(n^{μ_2/μ_1})$，当为$μ_1 > 2μ_2$时。当Willie和Alice的作业都有一般服务时间时，我们为Alice可以秘密执行的作业数量建立一个上限。这个界限与Fisher信息有关。还讨论了更一般的插入策略。
英文摘要：
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 $\mathcal{O}(\sqrt{n})$ when $μ_1 < 2μ_2$, $\mathcal{O}(\sqrt{n/\log n})$ when $μ_1 = 2μ_2$, and $\mathcal{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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
