Abstract
In this paper, we propose a new product network using a Cartesian product of hypercube and Kautz network, named as hyper-Kautz network. The proposed network possesses the properties of both hypercube and the Kautz network including logarithmic diameter, optimal connectivity, and simple routing algorithms.
Keywords
Introduction
Recently there has been an increasing interest in a class of interconnection networks called product networks. Product networks are obtained by applying the Cartesian product operation on basic topologies.
In this paper, we propose a new scalable product network by applying the Cartesian product operation on hypercube and Kautz network, named as hyper-Kautz network. In hyper-Kautz network, we can observe a trade-off between cost and performance.
Topological Structure of Hyper-Kautz
Definition 1
The hyper-Kautz network HK(n, k) is the product network H(n) ⊕ UK(k).
Each node in HK(n, k) is assigned a label (un−1…u0, vk-1…v0) where each ui is a binary bit and each vj∊{0, 1, 2} and vi ≠ vi+1, for 0 ≤ i ≤ k−2. We refer to un−1 …u0 as the hypercube-part-label and vk−1…v0 to as the Kautz-part-label of any node in HK(n, k).
It is easy to see that a node (un−1…u0, vk−1…v0) has an edge incident on the following nodes referred to as Kautz-part-neighbors
and to the following nodes referred to as hypercube-part-neighbors
Hyper-Kautz network has properties of Hamiltonian cycle, low mean internodal distance, and maximally fault tolerant, etc.
Conclusion
In this paper, we proposed the hyper-Kautz interconnection topology, which is the Cartesian product of hypercube and Kautz network. The hyper-Kautz network is an improvement over the hypercube and the Kautz network because hyper-Kautz network inherits properties of both the hypercube and the Kautz network.
