Bits through queues

Venkat Anantharam; Sergio Verdú

doi:10.1109/18.481773

Bits through queues

Venkat Anantharam, Sergio Verdú

Research output: Contribution to journal › Article › peer-review

228 Scopus citations

Abstract

The Shannon capacity of the single-server queue is analyzed. We show that the capacity is lowest, equal to e^-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-hearing packets are also analyzed.

Original language	English (US)
Pages (from-to)	4-18
Number of pages	15
Journal	IEEE Transactions on Information Theory
Volume	42
Issue number	1
DOIs	https://doi.org/10.1109/18.481773
State	Published - 1996

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Keywords

Channel capacity
Data networks
Queueing theory
Shannon theory
Single-server queue
Telephone-signaling channel

Access to Document

10.1109/18.481773

Cite this

@article{7052f9d1db33438397524220bdf88459,

title = "Bits through queues",

abstract = "The Shannon capacity of the single-server queue is analyzed. We show that the capacity is lowest, equal to e-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-hearing packets are also analyzed.",

keywords = "Channel capacity, Data networks, Queueing theory, Shannon theory, Single-server queue, Telephone-signaling channel",

author = "Venkat Anantharam and Sergio Verd{\'u}",

year = "1996",

doi = "10.1109/18.481773",

language = "English (US)",

volume = "42",

pages = "4--18",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

T1 - Bits through queues

AU - Anantharam, Venkat

AU - Verdú, Sergio

PY - 1996

Y1 - 1996

N2 - The Shannon capacity of the single-server queue is analyzed. We show that the capacity is lowest, equal to e-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-hearing packets are also analyzed.

AB - The Shannon capacity of the single-server queue is analyzed. We show that the capacity is lowest, equal to e-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-hearing packets are also analyzed.

KW - Channel capacity

KW - Data networks

KW - Queueing theory

KW - Shannon theory

KW - Single-server queue

KW - Telephone-signaling channel

UR - http://www.scopus.com/inward/record.url?scp=0029732709&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029732709&partnerID=8YFLogxK

U2 - 10.1109/18.481773

DO - 10.1109/18.481773

M3 - Article

AN - SCOPUS:0029732709

SN - 0018-9448

VL - 42

SP - 4

EP - 18

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 1

ER -

Bits through queues

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this