A covert queueing channel in fcfs schedulers

Amiremad Ghassami, Negar Kiyavash

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish (US)
Pages (from-to)1551-1563
Number of pages13
JournalIEEE Transactions on Information Forensics and Security
Volume13
Issue number6
DOIs
StatePublished - Jun 2018

Keywords

  • Capacity limit
  • Covert queueing channel
  • First-come-first-served scheduler

ASJC Scopus subject areas

  • Safety, Risk, Reliability and Quality
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'A covert queueing channel in fcfs schedulers'. Together they form a unique fingerprint.

Cite this