No BSD License
-
fsqfindewq(lambda,mu,c,m)
fsqfindewq(lambda,mu,c,m)
-
fsqfindld(lambda,mu,c,m)
fsqfindld(lambda,mu,c,m)
-
fsqfindldr(lambda,mu,c,m)
fsqfindldr(lambda,mu,c,m)
-
fsqfindlu(lambda,mu,c,m)
fsqfindlu(lambda,mu,c,m)
-
fsqfindp0(lambda,mu,c,m)
fsqfindp0(lambda,mu,c,m)
-
fsqfindpn(lambda,mu,c,m,n)
-
machine(lambda,mu,m,cw,cs)
-
mmcfindewq(lambda,mu,c)
mmcfindewq(lambda,mu,c)
-
mmcfindlq(lambda,mu,c)
mmcfindlq(lambda,mu,c)
-
mmcfindls(lambda,mu,c)
mmcfindls(lambda,mu,c)
-
mmcfindp0(lambda,mu,c)
mmcfindp0(lambda,mu,c)
-
mmcfindpn(lambda,mu,c,n)
mmcfindpn(lambda,mu,c,n)
-
View all files
from
Queueing Systems Toolbox
by Bill Higley
These deal with an M/M/c queue and a finite source queue
|
| mmcfindpn(lambda,mu,c,n)
|
%mmcfindpn(lambda,mu,c,n)
% This function finds the probability there are n customers
% in the system for an M/M/c queueing system.
function out = mmcfindpn(lambda,mu,c,n)
p = lambda/(mu*c);
pc = lambda/mu;
p0 = mmcfindp0(lambda,mu,c);
if n == 0
pn = p0;
end
if n >= 1
if n < c
pn = (pc^n)/factorial(n)*p0;
end
end
if n >= c
pn = (c^c)/factorial(c)*p0*p^n;
end
out = pn;
|
|
Contact us at files@mathworks.com