Bits through queues

1 January 1996

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory

Vol. 42 (1) , 4-18
https://doi.org/10.1109/18.481773

Abstract

The Shannon capacity of the single-server queue is analyzed. We show that the capacity is lowest, equal to e/sup -1/ nats per average service time, when the service time distribution is exponential. Further, this capacity cannot be increased by feedback. For general service time distributions, upper bounds for the Shannon capacity are determined. The capacities of the telephone signaling channel and of queues with information-bearing packets are also analyzed.

Keywords

This publication has 10 references indexed in Scilit:

Elements of Information Theory
Published by Wiley ,2001
A general formula for channel capacity
IEEE Transactions on Information Theory, 1994
Approximation theory of output statistics
IEEE Transactions on Information Theory, 1993
On the modeling and analysis of computer networks
Proceedings of the IEEE, 1993
On channel capacity per unit cost
IEEE Transactions on Information Theory, 1990
Capacity and error exponent for the direct detection photon channel. I
IEEE Transactions on Information Theory, 1988
On the capacity of channels with additive non-gaussian noise
Information and Control, 1978
Coding Theorems of Information Theory
Published by Springer Nature ,1978
Certain results in coding theory for noisy channels
Information and Control, 1957
A Mathematical Theory of Communication
Bell System Technical Journal, 1948