Title :
On the information-theoretic capacity of discrete-time queues
Author :
Bedekar, Anand S. ; Azizoglu, Murat
Author_Institution :
Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA
fDate :
29 Jun-4 Jul 1997
Abstract :
We analyze the information-theoretic capacity of two models of discrete-time queues, one involving single arrivals and single service in a slot, and the other involving batch arrivals and batch service. We explicitly specify the capacity-minimizing service distributions for both models, and obtain the resulting timing capacities
Keywords :
channel capacity; discrete time systems; packet switching; queueing theory; timing; batch arrivals; batch service; capacity-minimizing service distributions; discrete-time queues; information-theoretic capacity; packet arrival; packet departure; single arrivals; single service; timing capacities; Entropy; Equations; Information analysis; Information rates; Network address translation; Postal services; Queueing analysis; Random variables; Solid modeling; Timing;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613263
