A Covert Queueing Channel in Round Robin Schedulers.

We study a covert queueing channel 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 scenarios. Our results show that seemingly isolated users can communicate with high rate over the covert channel. Furthermore, we propose a practical finite-length code construction, which achieves the capacity limit.