Capacity of Systems with Queue-Length Dependent Service Quality

DOI10.1109/TIT.2017.2681682MaRDI QIDQ4682984zbMATH OpenFDO

Authors Avhishek Chatterjee, Daewon Seo, Lav R. Varshney

Publication date 19 September 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1603.01675

Queues and service in operations research (90B22) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Abstract: We study the information-theoretic limit of reliable information processing by a server with queue-length dependent quality of service. We define the capacity for such a system as the number of bits reliably processed per unit time, and characterize it in terms of queuing system parameters. We also characterize the distributions of the arrival and service processes that maximize and minimize the capacity of such systems in a discrete-time setting. For arrival processes with at most one arrival per time slot, we observed a minimum around the memoryless distribution. We also studied the case of multiple arrivals per time slot, and observed that burstiness in arrival has adverse effects on the system. The problem is theoretically motivated by an effort to incorporate the notion of reliability in queueing systems, and is applicable in the contexts of crowdsourcing, multimedia communication, and stream computing.

Cited in

(4)

This page was built for publication: Capacity of Systems with Queue-Length Dependent Service Quality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682984)