Modeling and Analysis on MTS-Clos Networks Serving Multi-slot Traffic

The multistage Clos network or C(m, n, r) is widely deployed in data communications and parallel computing systems because of its scalability. It is well known the network is strictly non-blocking if m2n-1. A new architecture of Multiple Time Slot Clos network (MTS-C (m, n, r)) is proposed in this paper, which is based on fast time slot interchangeable unit and serving for multi-slot traffic. The MTS-C (m, n, r) network keeps the original features while providing better switching performance. A new analytical model assuming a random routing strategy is established, and under this model the blocking probability of the C (m, n, r) network is analyzed. The analytical and simulation results show that a C (m, n, r) network with a small number of middle stage switches m, such as m=n+k, where k is small constant, is almost non-blocking for unicast connections.