循环赛中的隐性竞争渠道
A Covert Queueing Channel in Round Robin Schedulers
摘要：
本文研究了两个用户共享一个循环调度器的隐蔽共享信道（CQC）。当用户共享由循环策略仲裁的诸如计算机处理器或路由器之类的资源时，可以出现这样的隐蔽通道。我们提出了一个信息理论框架来建模和推导最大可靠数据传输速率，即，此通道的容量，用于无噪声和有噪声设置。我们的研究结果表明，看似孤立的用户可以通过隐蔽信道进行高速率通信，并证明了在循环调度器中CQC带来的重大信息泄漏和隐私威胁的可能性。此外，我们提出了实用的有限长度的代码的建设，实现了容量限制。
英文摘要：
We study a covert queueing channel (CQC) between two users sharing a round robin scheduler. Such a covert channel can arise when users share a resource such as a computer processor or a router arbitrated by a round robin policy. We present an information-theoretic framework to model and derive the maximum reliable data transmission rate, i.e., the capacity of this channel, for both noiseless and noisy setups. Our results show that seemingly isolated users can communicate with a high rate over the covert channel and demonstrate the possibility of significant information leakage and privacy threats brought by CQCs in round robin schedulers. Moreover, we propose practical finite-length code constructions, which achieve the capacity limit.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
