Bits through queues with feedback
Abstract
In their paper Anantharam and Verd\'u showed that feedback does not increase the capacity of a queue when the service time is exponentially distributed. Whether this conclusion holds for general service times has remained an open question which this paper addresses. Two main results are established for both the discrete-time and the continuous-time models. First, a sufficient condition on the service distribution for feedback to increase capacity under FIFO service policy. Underlying this condition is a notion of weak feedback wherein instead of the queue departure times the transmitter is informed about the instants when packets start to be served. Second, a condition in terms of output entropy rate under which feedback does not increase capacity. This condition is general in that it depends on the output entropy rate of the queue but explicitly depends neither on the queue policy nor on the service time distribution. This condition is satisfied, for instance, by queues with LCFS service policies and bounded service times.
Cite
@article{arxiv.1710.06190,
title = {Bits through queues with feedback},
author = {Laure Aptel and Aslan Tchamkerten},
journal= {arXiv preprint arXiv:1710.06190},
year = {2017}
}