Constructing Complete Binary Trees on Petersen-Torus Networks

In this study, it was proven that the complete binary tree might be embedded in PT(n,n). One-to-one embedding was done at congestion 1, expansion eDot 5, and dilation 3(n+1)/4 + 1 by applying how to construct H-tree in mesh network. The embedding at congestion 1 was appropriate for both store-and-forward routing system and wormhole routing system, and the one-to-one embedding reduced the processor load.