This paper describes all kinds of sorting routing algorithms and the characteristics of each algorithm used in optical interconnect networks. By adopting the dichotomy algorithm to make the conjunction appearance of the outside and inside node switches one by one and optimizing the Looping Algorithm to construct the routing label and the conjunction appearance of all-level node switches, the rearrangement non-blocking Omega, Banyan and Crossover network could be obtained. Each optical interconnect netw...