Bits Through Queues With Feedback

In their seminal 1996 paper, Anantharam and Verdú showed that feedback does not increase the capacity of a queue under First-in-First-Out service policy and exponentially distributed service time. Since the channel has memory, this negative result raises the question whether it extends to other non-...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2020-06, Vol.66 (6), p.3317-3326
Main Authors: Aptel, Laure, Tchamkerten, Aslan
Format: Article
Language:English
Subjects:
Channel capacity
Computer Science
Decoding
Engineering Sciences
Entropy
Feedback
Information Theory
Markov analysis
mutual information
Questions
Queueing analysis
Queues
Queuing theory
Random variables
Silicon
time varying channels
Timing
Transmitters
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In their seminal 1996 paper, Anantharam and Verdú showed that feedback does not increase the capacity of a queue under First-in-First-Out service policy and exponentially distributed service time. Since the channel has memory, this negative result raises the question whether it extends to other non-trivial combinations of service policy and service time. This paper addresses this question by providing two sufficient conditions under which feedback either increases capacity or does not increase capacity. The first is a sufficient condition on the service time distribution for feedback to increase capacity under First-In-First-Out service policy. The second is a sufficient condition for feedback not to increase capacity and is general in that it depends on the output distribution 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 Last-Come-First-Serve service policy and bounded service times.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2020.2970421