Journal of KIISE:Computer Systems and Theory (한국정보과학회논문지:시스템및이론)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Node Disjoint Parallel Paths of Even Network

이븐 연결망의 노드 중복 없는 병렬 경로

  • 김종석 (영남대학교 정보통신공학과) ;
  • 이형옥 (순천대학교 컴퓨터교육과)
  • Published : 2008.10.15
Download PDF
⟨ Previous Next ⟩

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.

[1]에서 A. Ghafoor는 고장허용 다중컴퓨터에 대한 하나의 모형으로 이븐 연결망 $E_d$를 소개하였고, 최단거리를 갖는 노드 중복 없는 경로를 포함한 여러 가지 성질들을 발표하였다. [1]에서 제안한 노드 중복 없는 경로에 의해 고장 지름을 구하면, 고장 지름은 d+2(d=홀수)와 d+3(d=짝수)이다. 그러나 [1]에서 증명한 노드 중복 없는 경로는 최단 거리가 아니다. 본 논문에서는 이븐 연결망 $E_d$가 노드 대칭임을 보이고, 순환적 교환 순서를 이용하여 이븐 연결망의 최단 거리를 갖는 노드 중복 없는 경로를 제시하고, 고장지름이 d+1임을 증명한다.

Keywords

References

  1. A. Ghafoor, "A Class of Fault-Tolerant Multiprocessor Networks," IEEE Trans. Reliability, Vol.38, No.1, pp. 5-15, 1989 https://doi.org/10.1109/24.24569
  2. 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
  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 https://doi.org/10.1109/71.824643
  4. M. S. Krishnamoorthy, and B. Krishnamurthy, "Fault diameter of interconnection networks," Comput. Math. Apl., Vol.13, No.5-6, pp. 577-582, 1987 https://doi.org/10.1016/0898-1221(87)90085-X
  5. S. A. Choudum, and V. Sunitha, "Augmented Cubes," Networks, Vol.40, No.2, pp. 71-84, 2002 https://doi.org/10.1002/net.10033
  6. 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 https://doi.org/10.1016/0012-365X(94)00084-V
  7. D. R. Duh, and G. H. Chen, "On the Rabin number problem," Networks, Vol.30, pp. 219-230, 1997 https://doi.org/10.1002/(SICI)1097-0037(199710)30:3<219::AID-NET6>3.0.CO;2-O
  8. 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
  9. 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 https://doi.org/10.1109/12.29465
  10. S. Latifi, "Combinatorial Analysis of the Fault- Diameter of the n-cube," IEEE. Trans. Computers, Vol.42, No.1, pp. 27-33, 1993 https://doi.org/10.1109/12.192211
  11. 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 https://doi.org/10.1007/BF01608486
  12. 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 https://doi.org/10.1109/71.899940
  13. Y. Saad, and H. Schultz, "Topological Properties of Hypercubes," IEEE. Trans. Computers, Vol.37, No.7, pp. 867-872. 1988 https://doi.org/10.1109/12.2234
  14. W. Shi and P. K. Srimani, "Hierarchical star: a new two level interconnection network," Journal of Systems Architecture, Vol.51, pp. 1-14, 2005 https://doi.org/10.1016/j.sysarc.2004.05.003
  15. 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 https://doi.org/10.1016/j.parco.2006.12.001
  16. 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 https://doi.org/10.1016/j.ipl.2004.11.005
  17. 김종석, 이형옥, "상호 연결망 하이퍼-스타 HS(2n,n)의 이분할 에지수와 고장지름 분석", 한국정보처리학회 논문지 A, Vol.12-A, No.6, pp. 499-506, 2005 https://doi.org/10.3745/KIPSTA.2005.12A.6.499
  18. 김희철, 임도빈, 박정흠, "다차원 토러스 네트워크의 고장지름과 서로소인 경로들", 한국정보과학회 논문지 A, Vol.34, No.5, pp. 176-186, 2007
  19. A. Ghafoor, "Partitioning of Even Networks for Improved Diagnosability," IEEE Trans. Reliability, Vol.39, No.3, pp. 281-286, 1990 https://doi.org/10.1109/24.103002