Patent Document ID: 20030117947
Application ID: 10290645
Patent Flag: 0

Claim One:
1. A method of providing a non-blocking routing network having a primary level (M) with n primary nodes (m — 0, m — 1, m_n−1) and a secondary level (R) with N&gE;n secondary nodes (r — 0, r — 1,..., r_N−1) and an intermediate level (I) with s intermediate nodes (i — 0, i — 1,... i_s−1), comprising the steps of: (a) partitioning said intermediate level (I) to obtain p copies I_u_v, u&equals;1,..., p; p>0 of q subsets I_v, u&equals;constant, v&equals;1,..., q; q>1 such that the relation p*q<sqrt(n) is satisfied, wherein sqrt(n) denotes the square root of n, (b) choosing functions f — 1,..., f_q defined for said secondary nodes (r — 0, r — 1,..., r_N−1) of said secondary level (R) for mapping said secondary nodes (r — 0, r — 1,..., r_N−1) to said intermediate level (I) such that (b1) f_a, a&equals;1..., q, is an element of I_a, and such that (b2) the identity (r_y&equals;&equals; r _z) of a first secondary node r_y with a second secondary note r_z follows from f_a(r_y)&equals;f_a(r_z) and f_b(r_y)&equals;f_b(r_z) for a<>b, (c) connecting each secondary node (r — 0, r — 1,..., r_N−1) to p*q intermediate nodes, wherein for a distinct secondary node r_d said p*q intermediate nodes are given by the mapping of the functions f — 1(r_d) 1,..., f — 1(r_d) p,..., f_q(r_d) 1,... f_q(r_d) p, wherein f_j( ) k denotes a mapping to the j-th subset I_k_j of the k-th copy I_j of said q subsets, and (d) connecting each primary node (m — 0, m — 1,..., m_n−1) to said s intermediate nodes (i — 0, i — 1,... i_s−1).