Covert Cycle Stealing in a Single FIFO Server
Covert Cycle Stealing in a Single FIFO Server
复制标题
单个 FIFO 服务器中的隐蔽周期窃取
DOI：
--
复制
发表时间：
2020
影响因子：
0.6
通讯作者：
D. Towsley
中科院分区：
文献类型：
--
作者：
Bo Jiang;P. Nain;D. Towsley
考虑这样一种设置，其中Willie生成泊松作业流，并将它们路由到遵循先进先出原则的单个服务器。假设有一个对手Alice，她希望在不被发现的情况下接受服务。我们问这个问题：她可以秘密获得多少工作，也就是说，不被威利发现？在威利和爱丽丝的服务时间分别为μ1和μ2的指数服务时间的情况下，我们证明了当服务器空闲时爱丽丝采用概率插入单个作业的策略时的相变：在n个忙期中，她可以获得O(√n)的隐蔽吞吐量，以期望插入的作业数来衡量，当μ1和lt；2μ2时，O(√nμn)，当μ1=2μ2时，O(nμ2/μ1)。当威利和爱丽丝的作业都具有一般服务时间时，我们建立了爱丽丝可以隐蔽执行的作业数的上界。这个界与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 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.