Cover Image

Feedback Increases the Capacity of Queues with Bounded Service Times

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sahasranand, K. R., Tchamkerten, Aslan
Format:	Preprint
Published:	2023
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Compression with Privacy-Preserving Random Access
by: Chandar, Venkat, et al.
Published: (2025)

Effective Context in Transformers: An Analysis of Fragmentation and Tokenization
by: Fesharaki, Amirmehdi Jafari, et al.
Published: (2026)

Robust Hypothesis Testing with Abstention
by: Managoli, Malhar A., et al.
Published: (2025)

Secure Distributed Hypothesis Testing
by: Kurri, Gowtham R., et al.
Published: (2026)

Feedback Does Not Increase the Capacity of Approximately Memoryless Surjective POST Channels
by: Zhang, Xiaojing, et al.
Published: (2026)

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
by: Liu, Yujie, et al.
Published: (2025)

Bounds on Covert Capacity with Sub-Exponential Random Slot Selection
by: Wang, Shi-Yuan, et al.
Published: (2024)

Feedback Capacity of the Continuous-Time ARMA(1,1) Gaussian Channel
by: Su, Jun, et al.
Published: (2023)

Capacity Bounds for Broadcast Channels with Bidirectional Conferencing Decoders
by: Farsani, Reza K., et al.
Published: (2024)

Binomial Channel: On the Capacity-Achieving Distribution and Bounds on the Capacity
by: Zieder, Ian, et al.
Published: (2024)

Capacity of Finite-State Channels with Delayed Feedback
by: Huleihel, Bashar, et al.
Published: (2023)

Capacity Bounds on Doppler OFDM Channels
by: Orellana, Pablo, et al.
Published: (2026)

Capacity Bounds for the Poisson-Repeat Channel
by: Kazemi, Mohammad, et al.
Published: (2024)

Analysis of Age of Information for A Discrete-Time hybrid Dual-Queue System
by: Chen, Zhengchuan, et al.
Published: (2024)

On Secrecy Capacity of Binary Beampointing Channels with Block Memory and Feedback
by: Li, Siyao, et al.
Published: (2025)

On the Sensing Capacity of Gaussian "Beam-Pointing" Channels with Block Memory and Feedback
by: Li, Siyao, et al.
Published: (2025)

Capacity Results for Intermittent X-Channels with Delayed Channel State Feedback
by: Vahid, Alireza
Published: (2018)

Dependence Balance and Capacity Bounds for Multiterminal Communication and Wiretap Channels
by: Gohari, Amin, et al.
Published: (2020)

Improved Capacity Outer Bound for Private Quadratic Monomial Computation
by: Dæhli, Karen M., et al.
Published: (2024)

Embodied Communication: Sensing-Induced Reliability Fields and Capacity Bounds
by: Shao, Yulin
Published: (2026)

Absorbing Markov Chain-Based Analysis of Age of Information in Discrete-Time Dual-Queue Systems
by: Feng, Yifan, et al.
Published: (2025)

The Duality Upper Bound for Finite-State Channels with Feedback
by: Huleihel, Bashar, et al.
Published: (2024)

List Decoding Bounds for Binary Codes with Noiseless Feedback
by: Gupta, Meghal, et al.
Published: (2024)

Peak Age of Information under Tandem of Queues
by: Sinha, Ashirwad, et al.
Published: (2024)

An Improved Lower Bound on Oblivious Transfer Capacity Using Polarization and Interaction
by: Suda, So, et al.
Published: (2025)

Simple Bounds for the Symmetric Capacity of the Rayleigh Fading Multiple Access Channel
by: Domanovitz, Elad, et al.
Published: (2019)

AoI in M/G/1/1 Queues with Probabilistic Preemption
by: Moltafet, Mohammad, et al.
Published: (2025)

Multi-Source M/G/1/1 Queues with Probabilistic Preemption
by: Moltafet, Mohammad, et al.
Published: (2025)

Capacity Bounds under Imperfect Polarization Tracking
by: Farsi, Mohammad, et al.
Published: (2021)

An Improved Lower Bound on Oblivious Transfer Capacity via Interactive Erasure Emulation
by: Suda, So, et al.
Published: (2024)

Bounding the Graph Capacity with Quantum Mechanics and Finite Automata
by: Meiburg, Alexander
Published: (2024)

Identification Capacity of the Discrete-Time Poisson Channel
by: Labidi, Wafa, et al.
Published: (2023)

Introduction to Queueing Theory and Stochastic Teletraffic Models
by: Zukerman, Moshe
Published: (2013)

Balancing Queueing and Retransmission: Latency-Optimal Massive MIMO Design
by: Du, Xu, et al.
Published: (2019)

An Achievability Bound for Variable-Length Stop-Feedback Coding over the Gaussian Channel
by: Papoutsidakis, Ioannis, et al.
Published: (2024)

Improved Bounds on the Number of Support Points of the Capacity-Achieving Input for Amplitude Constrained Poisson Channels
by: Barletta, Luca, et al.
Published: (2024)

Volume-Based Lower Bounds to the Capacity of the Gaussian Channel Under Pointwise Additive Input Constraints
by: Merhav, Neri, et al.
Published: (2025)

An Improved Lower Bound on Support Size of Capacity-Achieving Inputs for the Binomial Channel: Extended version
by: Baniasadi, Mohammadamin, et al.
Published: (2026)

Improved Capacity Upper Bounds for the Deletion Channel using a Parallelized Blahut-Arimoto Algorithm
by: Pinto, Martim, et al.
Published: (2026)

On the Age of Information in Single-Server Queues with Aged Updates
by: Miguelez, Fernando, et al.
Published: (2025)