DocumentCode :
1343063
Title :
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
Volume :
44
Issue :
2
fYear :
1998
fDate :
3/1/1998 12:00:00 AM
Firstpage :
446
Lastpage :
461
Abstract :
The information-theoretic capacity of continuous-time queues was analyzed recently by Anantharam and Verdu (see ibid. vol.42, p.4-18, 1996). Along similar lines, we analyze the information-theoretic capacity of two models of discrete-time queues. The first model has single packet arrivals and departures in a time slot and independent packet service times, and is the discrete-time analog of the continuous-time model analyzed by Anantharam and Verdu. We show that in this model, the geometric service time distribution plays a role analogous to that of the exponential distribution in continuous-time queues, in that, among all queues in this model with a given mean service time, the queue with geometric service time distribution has the least capacity. The second model allows multiple arrivals in each slot, and the queue is modeled as serving an independent random number of packets in each slot. We obtain upper and lower bounds on the capacity of queues with an arbitrary service distribution within this model, and show that the bounds coincide in the case of the queue that serves a geometrically distributed number of packets in each slot. We also discuss the extremal nature of the geometric service distribution within this model
Keywords :
channel capacity; discrete time systems; packet switching; queueing theory; statistical analysis; continuous-time model; continuous-time queues; discrete-time analog; discrete-time queues; exponential distribution; geometric service time distribution; independent packet service times; information-theoretic capacity; lower bound; mean service time; multiple arrivals; single packet arrivals; single packet departures; time slot; upper bound; Channel capacity; Exponential distribution; Helium; Information analysis; Information rates; Information theory; Queueing analysis; Random variables; Solid modeling; Timing;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.661496
Filename :
661496
Link To Document :
بازگشت