• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.357-358
• /
• 2008

폴디드 하이퍼스타 FHS(2n,n)은 하이퍼큐브와 그의 변형된 그래프보다 망 비용이 개선된 상호연결망이다. 본 논문에서는 폴디드 하이퍼스타 FHS(n-1,k-1)와 FHS(n-1,k) 그래프를 연결하여 폴디드 하이퍼스타 FHS(n,k)를 생성하는 방법을 제시하였다(단, n=2k). 또한, 정규 연결망 형태인 폴디드 하이퍼스타 FHS(2n,n)의 노드연결도는 n+1이고, 최대고장허용도를 가짐을 보인다.

• The KIPS Transactions:PartA
• /
• v.16A no.4
• /
• pp.299-306
• /
• 2009

Hierarchical Folded HyperStar Network has lower network cost than HCN(n,n) and HFN(n,n) which are hierarchical networks with the same number of nodes. In this paper, we analyze embedding between Hierarchical Folded HyperStar HFH($C_n,C_n$) and Hypercube, HCN(n,n), HFN(n,n). The results of embedding are that HCN(n,n), HFN(n,n) and Hypercube $Q_{2n}$ can be embedded into HFH($C_n,C_n$) with expansion $\frac{C^n}{2^{2n}}$ and dilation 2, 3, and 4, respectively. Also, HFH($C_n,C_n$) can be embedded into HFN(2n,2n) with dilation 1. These results mean so many developed algorithms in Hypercube, HCN(n,n), HFN(n,n) can be used efficiently in HFH($C_n,C_n$).

• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1227-1237
• /
• 2008

In this paper, we analyze topological properties and embedding of Folded Hyper-Star network to further improve the network cost of Hypercube, a major interconnection network. Folded Hyper-Star network has a recursive expansion and maximal fault tolerance. The result of embedding is that Folded Hypercube $FQ_n$ and $n{\times}n$ Torus can be embedded into Folded Hyper-Star FHS(2n,n) with dilation 2. Also, we show Folded Hyper-Star FHS(2n,n) can be embedded into Folded Hypercube $FQ_{2n-1}$ with dilation 1.

• The KIPS Transactions:PartA
• /
• v.17A no.1
• /
• pp.1-8
• /
• 2010

The fault diameter is one of the important measures for transmission rate and reliability of interconnection network. H.-O. Lee et al.[Parallel paths in folded hyper-star graph, Journal of KIPS, Vol.6, No.7, pp.1756-1769, 1999] suggested the node-disjoint paths of FHS (2n,n), and proved that the fault diameter of FHS(2n,n) is less than 2n-1. In this paper, we suggest an advanced node-disjoint paths of FHS(2n,n). We also prove that the wide diameter of FHS(2n,n) is dist(U,V)+4, and the fault diameter of FHS(2n,n) is less than n+2.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.501-508
• /
• 2009

In this paper, we prove that folded hyper-star network FHS(2n,n) is node-symmetric and a bipartite network. We show that FHS(2n,n) can be embedded into odd network On+1 with dilation 2, congestion 1 and Od can be embedded into FHS(2n,n) with dilation 2 and congestion 1. Also, we show that $2n{\time}n$ torus can be embedded into FHS(2n,n) with dilation 2 and congestion 2.