Capacity of queues via point-process channels

Authors:
Rajesh Sundaresan;Sergio Verdú
Affiliations:
Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore, India;Department of Electrical Engineering, Princeton University, Princeton, NJ
Venue:
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Year:
2006

Citing 6
Cited 1

Entropy and information theory

Entropy and information theory
Bits through queues

IEEE Transactions on Information Theory
The information-theoretic capacity of discrete-time queues

IEEE Transactions on Information Theory
Robust decoding for timing channels

IEEE Transactions on Information Theory
On the reliability exponent of the exponential timing channel

IEEE Transactions on Information Theory
Zero-rate reliability of the exponential-server timing channel

IEEE Transactions on Information Theory

Estimating the directed information to infer causal relationships in ensemble neural spike train recordings

Journal of Computational Neuroscience

Quantified Score

Hi-index	0.00

Visualization

Abstract

A conceptually simple proof for the capacity formula of an exponential server timing channel is provided. The proof links the timing channel to the point-process channel with instantaneous noiseless feedback. This point-process approach enables a study of timing channels that arise in multiserver queues, queues in tandem, and other simple configurations. Although the capacities of such channels remain to be found, the paper provides some analytical bounds and highlights a method to find achievable rates via simulations.