Feedback Increases the Capacity of Queues with Finite Support Service Times

In their "Bits Through Queues" paper, Anantharam and Verdú showed that if the service time is memoryless feedback does not increase capacity under a FIFO policy, and further conjectured that feedback increases capacity for all other service times. Towards this conjecture, a recent paper by...

Full description

Saved in:
Bibliographic Details
Main Authors: Sahasranand, K. R., Tchamkerten, Aslan
Format: Conference Proceeding
Language:English
Subjects:
Information theory
Queueing analysis
Sufficient conditions
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In their "Bits Through Queues" paper, Anantharam and Verdú showed that if the service time is memoryless feedback does not increase capacity under a FIFO policy, and further conjectured that feedback increases capacity for all other service times. Towards this conjecture, a recent paper by Aptel and Tchamkerten provided a sufficient condition on the service time under which feedback increases capacity. While this condition yields examples of service times for which feedback is helpful, it does not provide explicit structural properties of such service times.In this paper, we consider the discrete-time setting and show that feedback increases capacity for any service time with finite support. We also show that the above sufficient condition is inconclusive for service times with infinite support.
ISSN:2157-8117
DOI:10.1109/ISIT54713.2023.10206779