Embedding Algorithm among Folded Hypercube, Even Network and Odd Network
Jong-Seok Kim, Hyun Sub Sim, Hyeong-Ok Lee
Abstract
Jong-Seok Kim, Hyun Sub Sim, Hyeong-Ok Lee
Abstract
In this paper, we will analyze embedding among Folded Hypercube, Even Network and Odd Network to further improve the network cost of Hypercube. We will show Folded Hypercube can be embedded into Even Network with dilation 2, congestion 1 and Even Network can be embedded into Folded Hypercube with dilation 1. Also, we will prove Folded Hypercube can be embedded into Odd Network with dilation 2, congestion 1 and Odd Network can be embedded into Folded Hypercube with dilation 2, congestion 1. Finally, we will show Even Network can be embedded into Odd Network with dilation 2, congestion 1 and Odd Network can be embedded into Folded Hypercube with dilation 2, congestion 1.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we will analyze embedding among Folded Hypercube, Even Network and Odd Network to further improve the network cost of Hypercube. We will show Folded Hypercube can be embedded into Even Network with dilation 2, congestion 1 and Even Network can be embedded into Folded Hypercube with dilation 1. Also, we will prove Folded Hypercube can be embedded into Odd Network with dilation 2, congestion 1 and Odd Network can be embedded into Folded Hypercube with dilation 2, congestion 1. Finally, we will show Even Network can be embedded into Odd Network with dilation 2, congestion 1 and Odd Network can be embedded into Folded Hypercube with dilation 2, congestion 1.
Key concepts: Hypercube, Dilation (metric space), Embedding, Computer science, Parallel computing, Mathematics, Algorithm, Computer network