Abstract
Crossed cube is a variation of hypercube, but some properties of the former are superior to those of the latter. However, it is difficult to extend the scale of crossed cube networks. As a kind of hierarchical ring interconnection networks, crossed cube-connected ring interconnection network CRN can effectively overcome the disadvantage. Hence, it is a good topology for interconnection networks. In this paper, we prove that there exist n internally vertex-disjoint paths between any two vertexes in CRN, and analyze the lengths of the paths.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have