Hello PF,(adsbygoogle = window.adsbygoogle || []).push({});

I have an assignment on M/D/1/n queues and between all the formulas and theory, I am completely lost. I need to be able to calculate the idle probability, blocking probability, and average waiting time for different buffer sizes n (0,1,4, etc.). I can find the answers for the boundary cases 0 and infiniti, but its the others I am clueless. Can anyone give me some tips to point me in the right direction?

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# M/D/1/n Queueing Theory help

**Physics Forums | Science Articles, Homework Help, Discussion**