Entropy and the timing capacity of discrete queues

Authors:
B. Prabhakar;R. Gallager
Affiliations:
Dept. of Electr. Eng., Stanford Univ., CA, USA;-
Venue:
IEEE Transactions on Information Theory
Year:
2003

Citing 0
Cited 4

Towards an end-to-end delay analysis of wireless multihop networks

Ad Hoc Networks
Reliable and secure broadcast communication over resource constrained systems

Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Novel shaping and complexity-reduction techniques for approaching capacity over queuing timing channels

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A novel load metric with enhanced ability of distinguishing different load status

The Journal of Supercomputing

Quantified Score

Hi-index	754.84

Visualization

Abstract

Queueing systems which map Poisson input processes to Poisson output processes have been well-studied in classical queueing theory. This paper considers two discrete-time queues whose analogs in continuous-time possess the Poisson-in-Poisson-out property. It is shown that when packets arriving according to an arbitrary ergodic stationary arrival process are passed through these queueing systems, the corresponding departure process has an entropy rate no less (some times strictly more) than the entropy rate of the arrival process. Some useful by-products are discrete-time versions of: (i) a proof of the celebrated Burke's (1956) theorem, (ii) a proof of the uniqueness, amongst renewal inputs, of the Poisson process as a fixed point for exponential server queues proposed by Anantharam (1993), and (iii) connections with the timing capacity of queues described by Anantharam and Verdu (1996).