A large closed queueing network containing two types of node and multiple customer classes: one bottleneck station (Q702048)

The network is closed and contains server stations with infinite buffers and client stations that serve customers at random instants generated by a strictly stationary and ergodic sequence of random variables. After \(i\)th server station a customer goes to \(j\)th client station with probability \(p_{i,j}\) and returns to \(i\)th server station after the service. It is assumed that only one client station is a bottleneck. The non-stationary queue length distributions in non-bottleneck client stations are derived.