Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

I am still getting error message and we could not make the MMCQ Validation tests passed with the optimal values for lambda and mu for

I am still getting error message and we could not make the MMCQ Validation tests passed with the optimal values for lambda and mu for the trade studies results. % Part 1: Define parameters
c =2; % Number of servers
lambda =2; % Average Arrival Rate per minute
mu =0.1; % Service rate
Nwait =15; % Number of waiting cfunction [Ws, Wq, c_util, p_drop, p_state]= MMCQ(lambda, mu, c, Nwait)
% INPUTS:
% lambda = arrival rate
% mu = service rate
% Nwait = Number of queue elements, not including servers
% c = Number of servers
% OUTPUTS:
% Ws = Average wait in the system
% Wq = Average wait in the queue
% c_util = Average percentage of servers busy
% p_drop = probability the queue is full
% p_state = probability of each state
% INSERT YOUR CODE HERE
% Calculate traffic intensity
rho = lambda /(c * mu);
%% Compute the Erlang B formula to calculate the probability of blocking
% p_block = erlangb(c, rho);
% Calculate the utilization factor
c_util = rho / c;
% Calculate the probability of blocking
p_block = erlangb(c, rho);
% Display the result
% Calculate p0(probability of no customers in the system)
p0_denom = sum((c*rho).^(0:(c-1))./ factorial(0:(c-1)));
p0_denom = p0_denom +((c*rho)^c /(factorial(c)*(1-rho)))*(1-(rho^Nwait /(1- rho)));
p0=1/ p0_denom;
fprintf('p0: %.4f
', p0);
% Calculate pN (probability of having N customers in the system)
p_state = zeros(1, Nwait+1);
for i =1:Nwait
if i <= c
p_state(i+1)=(rho^i / factorial(i))* p0;
else
p_state(i+1)=(rho^i /(factorial(c)*(c^(i-c))))* p0;
end
end
pN = p_state(Nwait+1);
% Calculate p_drop (probability of a customer being dropped)
p_drop = pN;
% Calculate c_util (utilization of the servers)
c_util =(rho^c * p0)/(factorial(c)*(1- rho))*(1- rho^(Nwait - c +1));
% Calculate Wq (average waiting time in the queue)
Wq =((rho^(c+1))* p0)/(factorial(c)*(1- rho/Nwait)^2); % Average waiting time in the queue
% Print the result
fprintf('Average waiting time in the queue (Wq): %.2f', Wq);
% Calculate Ws (average time spent in the system)
Ws = Wq +(1/ mu);
% Print the results
fprintf('p0: %.4f ', p0); fprintf('pN: %.2f', p0);
end

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Beginning Apache Cassandra Development

Authors: Vivek Mishra

1st Edition

1484201426, 9781484201428

More Books

Students also viewed these Databases questions