Embedding Algorithm Between MRH(n) and Hypercube

In MRH(n) interconnection network, which has been recently proposed as a new phase for parallel processing, network cost (degree × diameter) is improved by reducing diameter and edge at the same time, while existing hypercube transformation graphs reduce just one of diameter or edge. This paper suggests an embedding method between Hypercube Network Q n and Multiple Reduced Hypercube Network MRH(n). In addition, this paper demonstrates that Hypercube Q n is embedded in MRH(n) at dilation 3 and expansion 2, and that average dilation is 2 or less.