An interconnection network, RP(k), and its properties are investigated. Two parameters, the closest group and the optimal partition of networks are proposed. It is shown that RP(k) network has high communication efficiency . It is also proven that RP(k) network is a Hamiltonian graph and the ring can be embedded into the RP(k) network with load, expansion, dilation and congestion all equal to 1 even though some faulty nodes exist in the RP(k) network. Embedding of Rings and 2-D meshes into the RP(k) networks are discussed. Two embedding methods are given with high embedding performance.
['Fangai Liu', 'Liancheng Xu']
The Topological Properties and Network Embedding of RP(k)