Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2010.17A.1.001

Fault Diameter of Folded Hyper-Star Interconnection Networks FHS(2n,n)  

Kim, Jong-Seok (영남대학교 전자정보공학부)
Lee, Hyeong-Ok (순천대학교 컴퓨터교육과)
Publication Information
The KIPS Transactions:PartA / v.17A, no.1, 2010 , pp. 1-8 More about this Journal
Abstract
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.
Keywords
Interconnection Network; Folded Hyper-Star; Node-Disjoint Path; Fault Diameter;
Citations & Related Records
Times Cited By KSCI : 5  (Citation Analysis)
연도 인용수 순위
1 K. Day and A. E. Al-Ayyoub, "Fault diameter of k-ary n-cube networks," IEEE Trans. Parallel and Distributed Systems, Vol.8, No.9, pp.903-907, 1997.   DOI   ScienceOn
2 J.-S. Kim, E. Cheng, L. Liptak, H.-O. Lee, "Embedding hypercubes, rings and odd graphs into Hyper-stars," International Journal of Computer Mathematics, Vol.86, No.5, pp.771-778, 2009.   DOI   ScienceOn
3 C.-P. Chang, T.-Y. Sung, and L.-H. Hsu, "Edge Congestion and Topological Properties of Crossed Cubes," IEEE Trans. Parallel and Distributed Systems, Vol.11, No.1, pp.64-80, 2000.   DOI   ScienceOn
4 E. Cheng and L. Liptak, "Structural properties of hyperstars," Ars Combinatoria, vol.80, pp.65-73, 2006.
5 E. Cheng and M. Shah, "A strong structural theorem for hyper-stars," Congressus Numerantium, Vol.179 pp.181-191, 2006.
6 D.-R. Duh, G.-H. Chen, and J.-F. Fang, "Algorithms and properties of a new two-level network with folded hypercubes as basic modules," IEEE Trans. Parallel and Distributed Systems, Vol.6, No.7, pp.714-723, 1995.   DOI   ScienceOn
7 J.-S. Fu, G.-H. Chen, and D.-R. Duh, "Node-disjo int paths and related problems on hierarchical cubic networks," Networks, Vol.40, No.3, pp.142-154, 2002.   DOI   ScienceOn
8 D. F. Hsu, "On container width and length in graphs, groups, and networks," IEICE Trans. Fundamentals of Electronics Communications and Computer Sciences E77-A, pp.668-680, 1994.
9 Y. Rouskov and P. K. Srimani, "Fault diameter of star graphs," Information Processing Letters, Vol.48, No.5, pp.243-251, 1993.   DOI   ScienceOn
10 S. Latifi, "Combinatorial Analysis of the Fault-Diameter of the n-cube," IEEE. Trans. Computers, Vol.42, No.1, pp.27-33, 1993.   DOI   ScienceOn
11 J.-S. Kim, H.-O. Lee, "Comments on "A Study of Odd Graphs as Fault-Tolerant Interconnection Networks"," IEEE Transactions on Computers, Vol.57, No.6, pp.864, 2008.   DOI   ScienceOn
12 김종석, 이형옥, "상호연결망 HS(2n,n)의 이분할 에지수와 고장 지름 분석", 정보처리학회논문지A, Vol.12-A, No.6, pp.499-506, 2005.
13 김종석, 이형옥, "PMC 모델과 비교진단모델을 이용한 하이퍼- 스타 연결망의 진단도 분석", 정보처리학회논문지A, Vol.13-A, No.1, pp.19-26, 2006.
14 H.-O. Lee, J.-S. Kim, E. Oh, H.-S. Lim, "Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube," Lecture Notes in Computer Science : EurAsia-ICT 2002, LNCS 2510, pp.858-865, 2002.
15 김종석, 이형옥, 김성원, "상호연결망 폴디드 하이퍼-스타 FHS(2n,n)의 대칭성과 임베딩 알고리즘", 한국정보처리학회 논문지, 게재예정   DOI
16 김종석, 오은숙, 이형옥, "하이퍼-스타 연결망의 위상적 망성질과 방송 알고리즘", 정보처리학회논문지A, Vol.11-A, No.5, pp.341-346, 2004.
17 김종석, "Folded 하이퍼-스타 FHS(2n,n)의 위상적 성질 분석," 정보처리학회 논문지 A, Vol.14-A, No.5, pp.263-268, 2007.
18 이형옥, 최정, 박승배, 조정호, 임형석, "Folded 하이퍼-스타 그래프의 병렬 경로", 한국정보처리학회논문지, Vol.6, No.7, pp.1756-1769, 1999.
19 M. Xu, J.-M. Xu, and X.-M. Hou, "Fault diameter of Cartesian product graphs, Infomation Processing Letters," Vol.93, No.5, pp.245-248, 2005.   DOI   ScienceOn
20 이형옥, 김병철, 임형석, "하이퍼-스타 그래프 : 다중 컴퓨터를 위한 새로운 상호 연결망", 한국정보처리학회논문지, Vol.5, No.12, pp.3099-3108, 1998.