Closed Queuing Network:

Exercise 15.3.1 Consider a closed queueing network of three nodes. Each node contains a single exponential server and the scheduling discipline is FCFS. The routing probability matrix is 0 0.7 0 1 0.3 0 0 0 The exponential service time distributions have a mean service time of 2.0 at node 1, 1.0 at node 2, and 0.5 at node 3. The number of customers that circulate in the network is equal to 3. Use the convolution algorithm to determine the marginal distribution of customers at node 1. Exercise 15.3.1 Consider a closed queueing network of three nodes. Each node contains a single exponential server and the scheduling discipline is FCFS. The routing probability matrix is 0 0.7 0 1 0.3 0 0 0 The exponential service time distributions have a mean service time of 2.0 at node 1, 1.0 at node 2, and 0.5 at node 3. The number of customers that circulate in the network is equal to 3. Use the convolution algorithm to determine the marginal distribution of customers at node 1