Title :
On the Shannon capacity of discrete time queues
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
fDate :
29 Jun-4 Jul 1997
Abstract :
Motivated by the analysis of high speed packet switched networks like ATM networks and the work on bits through queues, we analyze the information theoretic capacity of a discrete time queue. We assume that time is divided into slots and a random number of identical packets arrive during each slot. A server serves a random number of packets in a slot. We consider various cases of this channel, some of which are analogous to the continuous time case considered by Ananthram and Verdu (see IEEE Trans. Inform. Theory, vol.IT-42, p.4-18, 1996) and others which show some interesting new features
Keywords :
asynchronous transfer mode; buffer storage; channel capacity; discrete time systems; information theory; queueing theory; telecommunication networks; ATM networks; Shannon capacity; channel capacity; continuous time channel; discrete time queues; high speed packet switched networks; infinite buffer; information theoretic capacity; server; time slots; Asynchronous transfer mode; Channel capacity; Delay; Information analysis; Memoryless systems; Network servers; Packet switching; Queueing analysis; Timing; Upper bound;
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.613261
