The entropies of queue arrivals and queue departures

Summary form only given. We show that a variety of queueing systems are indeed entropy increasing in nature. The methods used to establish this are a combination of elementary techniques of information theory and queueing theory. We discuss the connection of these ideas with the recent work of Anantharam and Verdu (1996) on the information capacity of queues.

[1]  B. Prabhakar,et al.  On the Weak Convergence of Departures from an Infinite Series of $\cdot /M/ 1$ Queues , 1995 .

[2]  Sergio Verdú,et al.  Bits through queues , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[3]  B. Prabhakar,et al.  Convergence of Departures in Tandem Networks of·/GI/ ∞ Queues , 1996, Probability in the Engineering and Informational Sciences.