Personal tools
  •  

Bits and Queues

Document Actions
  • Content View
  • Bookmarks
  • CourseFeed

Achievability of the bound

It can also be shown (with a lot of work!) that for an $\cdot/M/1$ queue, the upper bound can be achieved when the input process is Poisson with rate $\lambda$ .

Thus


Copyright 2008, by the Contributing Authors. Cite/attribute Resource . admin. (2006, May 17). Bits and Queues. Retrieved January 07, 2011, from Free Online Course Materials — USU OpenCourseWare Web site: http://ocw.usu.edu/Electrical_and_Computer_Engineering/Information_Theory/lecture12_3.htm. This work is licensed under a Creative Commons License Creative Commons License