Bits through bufferless queues

2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013

Volumn , Issue , 2013, Pages 755-762

  Tavan, Mehrnaz ^a   Yates, Roy D ^a   Bajwa, Waheed U ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE; CONTROL ENGINEERING;

BUFFERLESS MODELS; DISTRIBUTED SERVICE; M/G/1 QUEUE; TIMING CHANNELS; UPPER BOUND;

QUEUEING THEORY;

EID: 84897732019     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2013.6736600     Document Type: Conference Paper

References (20)

1. B. Radosavljevic and B. Hajek, Hiding traffic flow in communication networks, in Proc. Military Communications Conference, 1992, pp. 1096-1100.
2. J. Giles and B. Hajek, An information-Theoretic and game-Theoretic study of timing channels, IEEE Transactions on Information Theory, vol. 48, no. 9, pp. 2455-2477, 2002.
3. G. Morabito, Exploiting the timing channel to increase energy efficiency in wireless networks, IEEE Journal on Selected Areas in Communications, vol. 29, no. 8, pp. 1711-1720, 2011.
4. B. Krishnaswamy, C. M. Henegar, J. P. Bardill, D. Russakow, G. L. Holst, B. K. Hammer, C. R. Forest, and R. Sivakumar, When bacteria talk: Time elapse communication for super-slow networks, plasmid, vol. 30, no. 217.5, pp. 6-2.
5. C. J. Quinn, T. P. Coleman, N. Kiyavash, and N. G. Hatsopoulos, Estimating the directed information to infer causal relationships in ensemble neural spike train recordings, Journal of computational neuroscience, vol. 30, no. 1, pp. 17-44, 2011.
6. Y. Liu and S. Aviyente, Information theoretic approach to quantify causal neural interactions from eeg, in Asilomar Conference on Signals, Systems and Computers. IEEE, 2010, pp. 1380-1384.
7. V. Anantharam and S. Verdu, Bits through queues, IEEE Transactions on Information Theory, vol. 42, no. 1, pp. 4-18, 1996.
8. C. Osorio and M. Bierlaire, A tractable analytical model for largescale congested protein synthesis networks, European J. Operational Research, vol. 219, no. 3, pp. 588-597, 2012.
9. S. Verdu and T. Han, A general formula for channel capacity, IEEE Transactions on Information Theory, vol. 40, no. 4, pp. 1147-1157, 1994.
10. A. S. Bedekar and M. Azizoglu, The information-Theoretic capacity of discrete-Time queues, IEEE Transactions on Information Theory, vol. 44, no. 2, pp. 446-461, 1998.
11. J. A. Thomas, On the shannon capacity of discrete time queues, in IEEE International Symposium on Information Theory. IEEE, 1997, p. 333.
12. R. Sundaresan and S. Verdu, Capacity of queues via point-process channels, IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2697-2709, 2006.
13. T. P. Coleman, A simple memoryless proof of the capacity of the exponential server timing channel, in Information Theory Workshop. IEEE, 2009, pp. 101-105.
14. S. H. Sellke, C.-C. Wang, N. Shroff, and S. Bagchi, Capacity bounds on timing channels with bounded service times, in IEEE International Symposium on Information Theory. IEEE, 2007, pp. 981-985.
15. P. Mimcilovic, Mismatch decoding of a compound timing channel, in Forty-Fourth Annual Allerton Conference on Communication, Control, and Computing, 2006.
16. E. Visotsky, V. Tripathi, and M. Honig, Optimum ARQ design: A dynamic programming approach, in Proceedings IEEE International Symposium on Information Theory, 2003. IEEE, 2003, p. 451.
17. Y. Polyanskiy, H. Poor, and S. Verdu, Feedback in the non-asymptotic regime, IEEE Transactions on Information Theory, vol. 57, no. 8, pp. 4903-4925, 2011.
18. R. Sundaresan and S. Verdu, Robust decoding for timing channels, IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 405-419, 2000.
19. T. M. Cover and J. A. Thomas, Elements of information theory. Wileyinterscience, 2012.
20. S. M. Ross, Stochastic processes john wiley and sons, New York, 1983.