The information-theoretic capacity of discrete-time queues

DOI10.1109/18.661496zbMath0926.94014OpenAlexW2125600492MaRDI QIDQ4400264

Anand S. Bedekar, Murat Azizoğlu

Publication date: 2 December 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6b1162153c7a9d8249ad73e3b72344d3b8058188

zbMATH Keywords

queueing theorygeometric distributionchannel capacityShannon theorysingle-server queuestiming capacity

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Coding theorems (Shannon theory) (94A24)

Related Items (5)

On the reliability exponent of the additive exponential noise channel ⋮ Invariant rate functions for discrete-time queues ⋮ Queues, stores, and tableaux ⋮ Batch queues, reversibility and first-passage percolation ⋮ Output Dead-Time in Point Processes

This page was built for publication: The information-theoretic capacity of discrete-time queues