Entropy and the timing capacity of discrete queues

  title={Entropy and the timing capacity of discrete queues},
  author={Balaji Prabhakar and Robert G. Gallager},
  journal={IEEE Trans. Information Theory},
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 continuoustime 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… CONTINUE READING
Highly Cited
This paper has 57 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 34 extracted citations

On the End-to-End Delay Performance of Spatially Correlated Wireless Line Networks

2008 IEEE International Conference on Communications • 2008
View 4 Excerpts
Highly Influenced

Feedback Increases the Capacity of Queues

2018 IEEE International Symposium on Information Theory (ISIT) • 2018
View 1 Excerpt

Timing capacity of queues with random arrival and modified service times

2016 IEEE International Symposium on Information Theory (ISIT) • 2016
View 3 Excerpts

Capacity analysis of a discrete-time bufferless timing channel

2014 48th Annual Conference on Information Sciences and Systems (CISS) • 2014
View 1 Excerpt

Zero-Error Capacity of a Class of Timing Channels

IEEE Transactions on Information Theory • 2014
View 1 Excerpt

57 Citations

Citations per Year
Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-8 of 8 references

Bits through queues

IEEE Trans. Information Theory • 1996

Uniqueness of stationary ergodic fixed point for it ./M/k node,

V. Anantharam
Ann. of App. Prob., • 1993

Finiteness of waiting - time moments in general stationary single - server queues

T. Rolski
Ann . Appl . Probab . • 1991

Remarks on processes of calls

N. Bambos
Proc . 1995 Conf . Information Sciences and Systems • 1978

On the weak convergence of departures from an infinite sequence of / M / 1 queues

B. Prabhakar
Ann . Appl . Probab . • 1962

On the Shannon Capacity of Discrete - time Quceues

J. A. Thomas

The output of a queueing system,

P. 13urke
Operations Research, • 1956

Similar Papers

Loading similar papers…