Font Size: a A A

Multistage Switching Network Routing Algorithm With Model.next Research

Posted on:2013-12-11Degree:MasterType:Thesis
Country:ChinaCandidate:Q SunFull Text:PDF
GTID:2248330374986405Subject:Communication and information system
Abstract/Summary:PDF Full Text Request
The multistage Clos network or C(n, m, 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 m≥2n-1.Two architecture of switching netwoks for the multiple time solt environment and practical application based on Clos nework topology was proposed in this paper. The first one architecture is Clos nework liked, but only the first stage and third stage ownd the time slot interchange ablitiy. This architecture was used in the optical switching networks, middle stage of which is Optical cross-module. Some routing strategy and a routing algorithm for the network were proposed;this algorithm was designed for some different block type and handle them in different ways. Additionaly, systematicly simulation was done for the algoriam, the result of which shows that rearrangements and time cost was low, compared with the tradionaly network and algoriam.A new architecture of Multiple Time Slot Clos network or MTS-C (n, m, r, t) is proposed in this paper, which is based on fast time slot interchangeable unit and serving tor multi-slot trattic.The MIS-C(m, n, r, t) network Keeps the original features whne providing better switching performance. Some routing strategy and a routing algorithm for the network were proposed; this algorithm was designed for some different block type and handle them in different ways. Additionaly, systematicly simulation was done for the algoriam, the result of which shows that rearrangements and time cost was low, compared with the tradionaly network and algoriam.A new analytical model assuming a random routing strategy is established, and under this model the blocking probability of the C(m, n, r, t) network is analyzed. The analytical and simulation results show that a C(m, n, r, t) 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.
Keywords/Search Tags:Multistage interconnection networks, Blocking probability, Multi-slot, Clos Networks
PDF Full Text Request
Related items