Node Mapping Algorithm between Hypercube and Petersen-Torus Networks

In this study, it was proven that hypercube interconnection network whose degree increases with increased dimensions might be embedded into PT network whose degree is fixed. Hypercube Q
<sub>log

2</sub>
n
²
+3 was embedded into PT(n,n) at expansion 10/8, dilation 1.5n+2, and congestion 4 n. The mapping algorithm was designed for expansion to approach 1, and congestion and dilation are in proportion to O(n) owing to the aspect of hypercube that the degree increases.