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, observing a minimum around the memoryless distribution. The problem is theoretically motivated by an effort to incorporate the notion of reliability in queueing systems, and is applicable in contexts of multimedia communication, crowdsourcing, and stream computing.
|Title of host publication
|Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016
|Institute of Electrical and Electronics Engineers Inc.
|Number of pages
|Published - Feb 2 2017
|3rd International Symposium on Information Theory and Its Applications, ISITA 2016 - Monterey, United States
Duration: Oct 30 2016 → Nov 2 2016
|3rd International Symposium on Information Theory and Its Applications, ISITA 2016
|10/30/16 → 11/2/16
ASJC Scopus subject areas
- Computer Networks and Communications
- Hardware and Architecture
- Information Systems
- Signal Processing
- Library and Information Sciences