Entropy and the Shannon capacity of queueing systems

摘要

Summary form only given. We show that a variety of queueingsystems are entropy increasing in nature. The methods used to establishthis are a combination of elementary techniques of information theoryand queueing theory. We discuss the connection of these ideas with thework of Anantharam and Verdu (1996) on the information capacity ofqueues