Feedback Increases the Capacity of Queues with Bounded Service Times
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910507001184256 |
|---|---|
| author | Sahasranand, K. R. Tchamkerten, Aslan |
| author_facet | Sahasranand, K. R. Tchamkerten, Aslan |
| contents | In the "Bits Through Queues" paper, it was hypothesized that full feedback always increases the capacity of first-in-first-out queues, except when the service time distribution is memoryless. More recently, a non-explicit sufficient condition under which feedback increases capacity was provided, along with simple examples of service times meeting this condition. While this condition yields examples where feedback is beneficial, it does not offer explicit structural properties of such service times.
In this paper, we show that full feedback increases capacity whenever the service time has bounded support. This is achieved by investigating a generalized notion of feedback, with full feedback and weak feedback as particular cases. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_14145 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Feedback Increases the Capacity of Queues with Bounded Service Times Sahasranand, K. R. Tchamkerten, Aslan Information Theory In the "Bits Through Queues" paper, it was hypothesized that full feedback always increases the capacity of first-in-first-out queues, except when the service time distribution is memoryless. More recently, a non-explicit sufficient condition under which feedback increases capacity was provided, along with simple examples of service times meeting this condition. While this condition yields examples where feedback is beneficial, it does not offer explicit structural properties of such service times. In this paper, we show that full feedback increases capacity whenever the service time has bounded support. This is achieved by investigating a generalized notion of feedback, with full feedback and weak feedback as particular cases. |
| title | Feedback Increases the Capacity of Queues with Bounded Service Times |
| topic | Information Theory |
| url | https://arxiv.org/abs/2309.14145 |