A Covert Queueing Channel in FCFS Schedulers
A Covert Queueing Channel in FCFS Schedulers
复制标题
DOI：
10.1109/tifs.2018.2797953
复制
发表时间：
2017-07
影响因子：
6.8
通讯作者：
AmirEmad Ghassami;N. Kiyavash
中科院分区：
文献类型：
--
作者：
AmirEmad Ghassami;N. Kiyavash
我们研究隐蔽排队信道（CQCs），它是一种隐蔽定时信道，可能在假定相互隔离的用户之间的共享队列中被利用。在我们的系统模型中，一个用户通过其访问共享资源的模式向另一个用户发送消息，该共享资源按照先到先服务（FCFS）策略为用户提供服务。这种信道的一个例子是数据中心网络中的跨虚拟网络隐蔽信道，它是由共享资源的排队效应产生的。首先，我们研究一个由一个发送器和一个接收器组成的系统，它们共享一个确定性的、保持工作的FCFS调度器，并且我们计算该信道的容量。我们还考虑了其他用户的存在对该信道信息传输速率的影响。本文中获得的可实现的信息传输速率证明了在FCFS调度器中CQCs可能导致大量信息泄露以及带来巨大的隐私威胁。
We study covert queueing channels (CQCs), which are a kind of covert timing channel that may be exploited in shared queues across supposedly isolated users. In our system model, a user sends messages to another user via his pattern of access to the shared resource, which serves the users according to a first come first served (FCFS) policy. One example of such a channel is the cross-virtual network covert channel in data center networks, resulting from the queueing effects of the shared resource. First, we study a system comprising a transmitter and a receiver that share a deterministic and work-conserving FCFS scheduler, and we compute the capacity of this channel. We also consider the effect of the presence of other users on the information transmission rate of this channel. The achievable information transmission rates obtained in this paper demonstrate the possibility of significant information leakage and great privacy threats brought by CQCs in FCFS schedulers.