Browse > Article

Node Disjoint Parallel Paths of Even Network  

Kim, Jong-Seok (영남대학교 정보통신공학과)
Lee, Hyeong-Ok (순천대학교 컴퓨터교육과)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.35, no.9_10, 2008 , pp. 421-428 More about this Journal
Abstract
A. Ghafoor proposed Even networks as a class of fault-tolerant multiprocessor networks in [1] and analyzed so many useful properties include node disjoint paths. By introducing node disjoint paths in [1], fault diameter of Even networks is d+2(d=odd) and d+3(d=even). But the lengths of node disjoint paths proved in [1] are not the shortest. In this paper, we show that Even network Ed is node symmetric. We also propose the shortest lengths of node disjoint paths using cyclic permutation, and fault diameter of Even networks is d+1.
Keywords
Interconnection network; Even network; Node symmetry; Node disjoint path; Fault diameter; Cyclic permutation;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 S. A. Choudum, and V. Sunitha, "Augmented Cubes," Networks, Vol.40, No.2, pp. 71-84, 2002   DOI   ScienceOn
2 D. R. Duh, and G. H. Chen, "On the Rabin number problem," Networks, Vol.30, pp. 219-230, 1997   DOI   ScienceOn
3 P. Fragopoulou, and S. G. Akl, "Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance," IEEE. Trans. Computers, Vol.45, No.2, pp. 174-185, 1993
4 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
5 W. Shi and P. K. Srimani, "Hierarchical star: a new two level interconnection network," Journal of Systems Architecture, Vol.51, pp. 1-14, 2005   DOI   ScienceOn
6 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
7 B. Parhami and D.-M. Kwai, "Unified Formulation of Honeycomb and Diamond Networks," IEEE Trans. Parallel and Distributed Systems, Vol.12, No.1, pp. 74-80, 2001   DOI   ScienceOn
8 S. B. Akers, D. Harel, and B. Krishnamurthy, "The Star Graph: An Attractive Alternative to the n-Cube," Proc. Int'l. Conf. on Parallel Processing, pp. 393-400, 1987
9 D. Z. Du, D. F. Hsu, and Y. D. Lyuu, "On the diameter vulnerability of Kautz digraphs," Discrete Math. Vol.151, pp. 81-85, 1996   DOI
10 A. Ghafoor, "Partitioning of Even Networks for Improved Diagnosability," IEEE Trans. Reliability, Vol.39, No.3, pp. 281-286, 1990   DOI   ScienceOn
11 Y. Saad, and H. Schultz, "Topological Properties of Hypercubes," IEEE. Trans. Computers, Vol.37, No.7, pp. 867-872. 1988   DOI   ScienceOn
12 J.-S. Yang, S.-M. Tang, J.-M. Chang, and Y.-L. Wang, "Parallel Construction of Optimal Independent Spanning Trees on Hypercubes," Parallel Computing, Vol.33, pp. 73-79, 2007   DOI   ScienceOn
13 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
14 김종석, 이형옥, "상호 연결망 하이퍼-스타 HS(2n,n)의 이분할 에지수와 고장지름 분석", 한국정보처리학회 논문지 A, Vol.12-A, No.6, pp. 499-506, 2005   과학기술학회마을   DOI
15 김희철, 임도빈, 박정흠, "다차원 토러스 네트워크의 고장지름과 서로소인 경로들", 한국정보과학회 논문지 A, Vol.34, No.5, pp. 176-186, 2007   과학기술학회마을
16 M. S. Krishnamoorthy, and B. Krishnamurthy, "Fault diameter of interconnection networks," Comput. Math. Apl., Vol.13, No.5-6, pp. 577-582, 1987   DOI   ScienceOn
17 S. L. Johnsson, and C. T. Ho, "Optimum Broadcasting and Personalized Communication in Hyperubes," IEEE. Trans. Computers, Vol.38, No.9, pp. 1249-1268, 1989   DOI   ScienceOn
18 A. Ghafoor, "A Class of Fault-Tolerant Multiprocessor Networks," IEEE Trans. Reliability, Vol.38, No.1, pp. 5-15, 1989   DOI   ScienceOn
19 S. C. Liaw, G. J. Chang, F. Cao, and D. F. Hsu, "Fault-tolerant routing in circulant networks and cycle prefix networks," Ann. Comb., Vol.2, No.5-6, pp. 165-172, 1998   DOI   ScienceOn