This page contains assignment #4 for
Performance Evaluation. This assignment is due on Monday,
October 25 in class. Any solutions that you find "on the web"
must be referenced as such. Please start each problem on a new
sheet of paper and put your name on all sheets of paper.
Below is a three-state discrete-time Markov chain. Solve for the steady
state probabilities in two ways. First, solve by setting up the 3 equations
in 3 unknowns and solving (show your work). Second, solve interatively using
iter.c. Submit a print-out of the "in.dat" for iter.c
and the output of iter.c.
Below is a three-state transition rate diagram. Solve for the steady
state probabilities in two ways. First, solve by setting up the 3 equations
in 3 unknowns and solving (show your work). Second, solve interatively using
iter.c. Submit a print-out of the "in.dat" for iter.c
and the output of iter.c.
Below is a five-state discrete-time Markov chain. Solve for the steady
state probabilities in any way you want. Hint: THINK.
You are responsible for the capacity planning for a call center. Assume
that calls arrive at a rate of 100 per hour. If it takes an average of 5
minutes to handle a call, what is the least number of operators needed if
you want less than 1% of calls to receive a busy signal. A busy signal will
occur for an incoming call if all operators are busy with a call (i.e., all
operators are talking on the telephone). Hint: The program
erlang.c might be useful.
Solve for the mean throughput and delay for the below closed queueing
network. The service rates are in customers per second and there are
10 customers in the (closed) system. Hint: The program
erlang.c might be useful.This problem removed on
October 19, 2004
