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 language | English (US) |
|---|---|
| State | Published - 1994 |
| Event | Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: Jun 27 1994 → Jul 1 1994 |
Other
| Other | Proceedings of the 1994 IEEE International Symposium on Information Theory |
|---|---|
| City | Trodheim, Norw |
| Period | 6/27/94 → 7/1/94 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics