Consider the network of queues shown in Figure 1 below. Assume that all arrival
ID: 664661 • Letter: C
Question
Consider the network of queues shown in Figure 1 below. Assume that all arrival and service processes have exponential distributions, and that this system can be modeled as a network of independent M/M/1 queuing systems using Jackson's Theorem.
Compute the mean times that a packet spends in each segment of this system, namely T1, T2, T3 and T4, as well as the average time that a packet spends in the entire system T, given the arrival rates, service rates and traffic partitioning probabilities given in this figure.
I understand that to solve the individual times you need to follow the forumla:
But what would p1 be and p2, p3, and p4 be according to the figure above? How do you get them?
Please don't copy the other chegg answers to this question.
Explanation / Answer
T1=30 pkts/sec
T2=15 pkts/sec
T3= 20 Pkts/sec
T4=10 pkts/sec