The information-theoretic capacity of discrete-time queues

IEEE Transactions on Information Theory

Volumn 44, Issue 2, 1998, Pages 446-461

  Bedekar, Anand S ^b   Azizoglu, Murat ^a,b  

^a IEEE

^b University of Washington   (United States)

Author keywords

Channel capacity; Discrete time queues; Geometric distribution; Queueing theory; Shannon theory; Timing capacity

Indexed keywords

CODES (SYMBOLS); GEOMETRY; INFORMATION THEORY; MATHEMATICAL MODELS; PACKET SWITCHING; QUEUEING THEORY;

DISCRETE TIME QUEUES; GEOMETRIC SERVICE DISTRIBUTION; PACKET SERVICE TIMES; SHANNON THEORY;

CHANNEL CAPACITY;

EID: 0032022695     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.661496     Document Type: Article

References (9)

1. V. Anantharam and S. Verdú, Bits through queues," IEEE Trans. Inform. Theory, vol. 42, pp. 4-18, Jan. 1996.
2. S. Verdú and T. S. Han, "A general formula for channel capacity," IEEE Trans. Inform. Theory, vol. 40, pp. 1147-1157, July 1994.
3. J. A. Thomas, "On the Shannon capacity of discrete-time queues," in Proc. 1997 IEEE Int. Symp. on Information Theory (Ulm, Germany, July 1997), p. 333.
4. H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation, vol. 3. Amsterdam, The Netherlands: North Holland, 1993.
5. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
6. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
7. M. E. Woodward, Communication and Computer Networks: Modelling With Discrete-Time Queues. Los Alamitos, CA: IEEE Comput. Soc. Press, 1994.
8. H. Bruneel and B. G. Kim, Discrete-Time Models for Communication Systems Including ATM. Boston, MA: Kluwer, 1993.
9. R. G. Gallager, Discrete Stochastic Processes. Boston, MA: Kluwer, 1996.