Bits through queues

Venkat Anantharam, Sergio Verdu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

It is demonstrated that in the information theoretic analysis of queueing systems, exponential service turns out to play the same role that the Gaussian noise plays in additive noise channels. This exponential service is seen to result to closed-form results and it is also the service distribution with the lowest capacity for a fixed service rate. This is the first time that the ·/M/1 queue is shown to be the worst among all ·/G/1 queues according to any criterion.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
PublisherIEEE
StatePublished - Dec 1 1994
Externally publishedYes
EventProceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw
Duration: Jun 27 1994Jul 1 1994

Other

OtherProceedings of the 1994 IEEE International Symposium on Information Theory
CityTrodheim, Norw
Period6/27/947/1/94

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Bits through queues'. Together they form a unique fingerprint.

  • Cite this

    Anantharam, V., & Verdu, S. (1994). Bits through queues. In IEEE International Symposium on Information Theory - Proceedings IEEE.