Bits through queues

被引：181

作者：

Anantharam, V ^{[1
]}

Verdu, S ^{[1
]}

机构：

[1] PRINCETON UNIV, DEPT ELECT ENGN, PRINCETON, NJ 08544 USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1996年 / 42卷 / 01期

关键词：

Shannon theory; channel capacity; queueing theory; single-server queue; telephone-signaling channel; data networks;

D O I：

10.1109/18.481773

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 bearing packets are also analyzed.

引用

页码：4 / 18

页数：15

共 14 条

[1] Bertsekas D. P., 1992, DATA NETWORKS
[2] Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X
[3] CSISZAR I, 1981, INFORMATION THEORY C
[4] HAN TS, 1993, IEEE T INFORM THEORY, V39, P752, DOI 10.1109/18.256486
[5] CAPACITY OF CHANNELS WITH ADDITIVE NON-GAUSSIAN NOISE
IHARA, S
[J]. INFORMATION AND CONTROL, 1978, 37 (01): : 34 - 39
[6] ON THE MODELING AND ANALYSIS OF COMPUTER-NETWORKS
KLEINROCK, L
[J]. PROCEEDINGS OF THE IEEE, 1993, 81 (08) : 1179 - 1191
[7] Kleinrock L., 1975, QUEUEING SYSTEMS VOL
[8] Shannon C.E., 1957, Inform. Contr., V1, P6, DOI DOI 10.1016/S0019-9958(57)90039-6
[9] A MATHEMATICAL THEORY OF COMMUNICATION
SHANNON, CE
[J]. BELL SYSTEM TECHNICAL JOURNAL, 1948, 27 (03): : 379 - 423
[10] ON CHANNEL CAPACITY PER UNIT COST
VERDU, S
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (05) : 1019 - 1030

← 1 2 →