The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—We introduce and analyze a new interconnection topology, called the <it>k</it>-dimensional <it>folded Petersen</it> (<it>FP</it><sub><it>k</it></sub>) network, which is constructed by iteratively applying the Cartesian product operation on the well-known Petersen graph.</p><p>Since the number of nodes in <it>FP</it><sub><it>k</it></sub> is restricted to a power of ten, for better scalability we propose a generalization, the <it>folded Petersen cube</it> network <it>FPQ</it><sub><it>n</it>,<it>k</it></sub> = <it>Q</it><sub><it>n</it></sub>×<it>FP</it><sub><it>k</it></sub>, which is a product of the <it>n</it>-dimensional binary hypercube (<it>Q</it><sub><it>n</it></sub>) and <it>FP</it><sub><it>k</it></sub>. The <it>FPQ</it><sub><it>n</it>,<it>k</it></sub> topology provides regularity, node- and edge-symmetry, optimal connectivity (and therefore maximal fault-tolerance), logarithmic diameter, modularity, and permits simple self-routing and broadcasting algorithms. With the same node-degree and connectivity, <it>FPQ</it><sub><it>n</it></sub>,<it>k</it> has smaller diameter and accommodates more nodes than <it>Q</it><sub><it>n</it>+3</sub><it>k</it>, and its packing density is higher compared to several other product networks.</p><p>This paper also emphasizes the versatility of the folded Petersen cube networks as a multicomputer interconnection topology by providing embeddings of many computationally important structures such as rings, multi-dimensional meshes, hypercubes, complete binary trees, tree machines, meshes of trees, and pyramids. The dilation and edge-congestion of all such embeddings are at most two.</p>
Average distance, broadcasting, embedding, fault-tolerance, folded Petersen graph, hypercube, interconnection network, mesh, pyramid, routing, tree.

S. Öhring and S. K. Das, "Folded Petersen Cube Networks: New Competitors for the Hypercubes," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 151-168, 1996.
88 ms
(Ver 3.3 (11022016))