Abstract-The exponential server timing channel is known to be the simplest, and in some sense canonical, queuing timing channel. The capacity of this infinite-memory channel is known. Here, we discuss practical finite-length restrictions on the codewords and attempt to understand the maximal rate that can be achieved for a target error probability. By using Markov chain analysis, we prove a lower bound on the maximal channel coding rate achievable at blocklength n and error probability . The bound is approximated by C − n −1/2 σQ −1 ( ) where Q denotes the Q-function and σ 2 is the asymptotic variance of the underlying Markov chain. A closed form expression for σ 2 is given.
Riedl et al. REF considered the usage of the aforementioned channel with finite-length codewords and obtained a lower bound on the maximal rate achievable.
Finite block-length achievable rates for queuing timing channels
2011 IEEE Information Theory Workshop
2011 IEEE Information Theory Workshop
Mathematics Computer Science