BITS THROUGH QUEUES

Authors
ANANTHARAM V VERDU S
Citation
V. Anantharam et S. Verdu, BITS THROUGH QUEUES, IEEE transactions on information theory, 42(1), 1996, pp. 4-18
Citations number
14
Categorie Soggetti
Information Science & Library Science","Engineering, Eletrical & Electronic
Journal title
IEEE transactions on information theory → ACNP
ISSN journal
00189448
Volume
42
Issue
1
Year of publication
1996
Pages
4 - 18
Database
ISI
SICI code
0018-9448(1996)42:1<4:BTQ>2.0.ZU;2-D
Abstract
The Shannon capacity of the single-server queue is analyzed. We show t hat the capacity is lowest, equal to e(-1) nats per average service ti me, when the service time distribution is exponential. Further, this c apacity cannot be increased by feedback. For general service time dist ributions, upper bounds for the Shannon capacity are determined. The c apacities of the telephone signaling channel and of queues with inform ation bearing packets are also analyzed.