Bits through bufferless queues

This paper investigates the capacity of a channel in which information is conveyed by the timing of consecutive packets passing through a queue with independent and identically distributed service times. Such timing channels are commonly studied under the assumption of a work-conserving queue. In contrast, this paper studies the case of a bufferless queue that drops arriving packets while a packet is in service. Under this bufferless model, the paper provides upper bounds on the capacity of timing channels and establishes achievable rates for the case of bufferless M/M/1 and M/G/1 queues. In particular, it is shown that a bufferless M/M/1 queue at worst suffers less than 10% reduction in capacity when compared to an M/M/1 work-conserving queue.

[1]  Rajesh Sundaresan,et al.  Capacity of queues via point-process channels , 2006, IEEE Transactions on Information Theory.

[2]  Michel Bierlaire,et al.  A tractable analytical model for large-scale congested protein synthesis networks , 2012, Eur. J. Oper. Res..

[3]  Saurabh Bagchi,et al.  Capacity Bounds on Timing Channels with Bounded Service Times , 2007, 2007 IEEE International Symposium on Information Theory.

[4]  Sergio Verdú,et al.  A general formula for channel capacity , 1994, IEEE Trans. Inf. Theory.

[5]  Bruce E. Hajek,et al.  An information-theoretic and game-theoretic study of timing channels , 2002, IEEE Trans. Inf. Theory.

[6]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[7]  Giacomo Morabito,et al.  Exploiting the Timing Channel to Increase Energy Efficiency in Wireless Networks , 2011, IEEE Journal on Selected Areas in Communications.

[8]  Bruce Hajek,et al.  Hiding traffic flow in communication networks , 1992, MILCOM 92 Conference Record.

[9]  Sergio Verdú,et al.  Bits through queues , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[10]  Ying Liu,et al.  Information theoretic approach to quantify causal neural interactions from EEG , 2010, 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers.

[11]  P. Momčilović.  Mismatch Decoding of a Compound Timing Channel , 2006 .

[12]  H. Vincent Poor,et al.  Feedback in the Non-Asymptotic Regime , 2011, IEEE Transactions on Information Theory.

[13]  Anand S. Bedekar,et al.  The Information-Theoretic Capacity of Discrete-Time Queues , 1997, IEEE Trans. Inf. Theory.

[14]  Michael L. Honig,et al.  Optimum ARQ design: a dynamic programming approach , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[15]  Raghupathy Sivakumar,et al.  When bacteria talk: Time elapse communication for super-slow networks , 2013, 2013 IEEE International Conference on Communications (ICC).

[16]  Todd P. Coleman,et al.  Estimating the directed information to infer causal relationships in ensemble neural spike train recordings , 2010, Journal of Computational Neuroscience.

[17]  Sergio Verdú,et al.  Approximation theory of output statistics , 1993, IEEE Trans. Inf. Theory.

[18]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[19]  Rajesh Sundaresan,et al.  Robust decoding for timing channels , 2000, IEEE Trans. Inf. Theory.

[20]  Todd P. Coleman.  A simple memoryless proof of the capacity of the exponential server timing channel , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.

[21]  Joy A. Thomas.  On the Shannon capacity of discrete time queues , 1997, Proceedings of IEEE International Symposium on Information Theory.

[22]  Amiel Feinstein,et al.  A new basic theorem of information theory , 1954, Trans. IRE Prof. Group Inf. Theory.