A Simple Memoryless Proof of the Capacity of the Exponential Server Timing Channel

Date Added: Apr 2009
Format: PDF

This paper provides a conceptually simple, memoryless-style proof to the capacity of the Anantharam and Verdu's Exponential Server Timing Channel (ESTC). The approach is inspired by Rubin's approach for characterizing the rate-distortion of a Poisson process with structured distortion measures. This approach obviates the need for using the information density to prove achievability, by exploiting: the ESTC channel on [0; nT] law is a product of [0; T] ESTC channel laws given intermediate queue states and for Poisson inputs, the queue states form a Harris-recurrent Markov process.