Consider the finite M/M/1 queue holding at most N packets. a. Show that the blocking probability is PB = 1/(N + 1) at p = 1. b. Plot PB = PN for all values of p, 0≤p< for N = 4 and N = 19. c. The throughput is defined to be y = (1-PB). Sketch y/μ (the normalized throughput) as a function of p = 2/µ (normalized load) for 0 ≤p<∞, N = 4, and N = 19. Compare.

Consider the finite M/M/1 queue holding at most N packets. a. Show that the blocking probability is PB = 1/(N + 1) at p = 1. b. Plot PB = PN for all values of p, 0≤p< for N = 4 and N = 19. c. The throughput is defined to be y = (1-PB). Sketch y/μ (the normalized throughput) as a function of p = 2/µ (normalized load) for 0 ≤p<∞, N = 4, and N = 19. Compare.

Algebra & Trigonometry with Analytic Geometry

13th Edition

ISBN:9781133382119

Author:Swokowski

Publisher:Swokowski

Chapter10: Sequences, Series, And Probability

Section10.8: Probability

Problem 31E

See similar textbooks