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

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

하이퍼큐브형 상호연결망의 비쌍형 다대다 서로소인 경로 커버

Unpaired Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks

  • 박정흠 (가톨릭대학교 컴퓨터정보공학부)
  • 발행 : 2006.10.15
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

그래프 G의 비쌍형 다대다 k-서로소인 경로 커버(k-DPC)는 k개의 서로 다른 소스 정점과 싱크 정점을 연결하며 그래프에 있는 모든 정점을 지나는 k개의 서로소인 경로 집합을 말한다 여기서 한 소스는 임의의 한 싱크와 짝지어질 수 있다. 이 논문에서는 하이퍼큐브형 상호연결망의 한 부류인 제한된 HL-그래프에서 비쌍형 다대다 DPC를 고려하여, 고장인 요소(정점이나 에지)의 수가 f 이하인 모든 m차원 제한된 HL-그래프$(m{\geq}3)$는 $f+k{\leq}m-2$을 만족하는 임의의 $f{\geq}0,\;k{\geq}1$에 대하여 비쌍형 다대다 k-DPC를 가짐을 보인다.

An unpaired many-to-many k-disjoint nth cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct sources and sinks in which each vertex of G is covered by a path. Here, a source can be freely matched to a sink. In this paper, we investigate unpaired many-to-many DPC's in a subclass of hpercube-like interconnection networks, called restricted HL-graphs, and show that every n-dimensional restricted HL-graph, $(m{\geq}3)$, with f or less faulty elements (vertices and/or edges) has an unpaired many-to-many k-DPC for any $f{\geq}0\;and\;k{\geq}1\;with\;f+k{\leq}m-2$.

키워드

참고문헌

  1. J.-H. Park, 'One-to-one disjoint path covers in recursive circulants,' Journal of KISS 30(12), pp. 691-698, 2003
  2. C.-H. Tsai, J.J.M. Tan, and L.-H. Hsu, 'The super-connected property of recursive circulant graphs,' Inform. Proc. Lett. 91(6), pp. 293-298, 2004 https://doi.org/10.1016/j.ipl.2004.05.013
  3. C.-H. Chang, C.-K. Lin, H.-M. Huang, and L.-H. Hsu, 'The super laceability of the hypercubes,' Inform. Proc. Lett. 92(1), pp. 15-21, 2004 https://doi.org/10.1016/j.ipl.2004.06.006
  4. J.- H. Park. 'One-to-many disjoint path covers in a graph with faulty elements,' in Proc. of the International Computing and Combinatorics Conference COCOON 2004. pp. 392-401, Aug. 2004
  5. J.-H. Park, H.-C. Kim, and H.-S. Lim, 'Many-to-many disjoint path covers in a graph with faulty elements,' in Proc. of the International Symposium on Algoritluns and Computation ISAAC 2004, pp. 742-753, Dec. 2004
  6. J.-H. Park, H.-C. Kim, and H.-S. Lim, 'Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements,' IEEE Trans. Parallel and Distributed Systems 17(3), pp. 227-240, Mar. 2006 https://doi.org/10.1109/TPDS.2006.37
  7. 박정흠, '이중 루프 네트워크의 다대다 서로소인 경로 커버', 한국정보과학회논문지 32(8),pp. 426-431, 2005년 8월
  8. J.-H. Park, H.-C. Kim, and H.-S. Lim, 'Fault-hamiltonicity of hypercube-like interconnection networks,' in Proc. of the IEEE International Parallel & Distributed Processing Symposium IPDPS 2005, Apr. 2005 https://doi.org/10.1109/IPDPS.2005.223
  9. P.AJ. Hilbers, M.R.J. Koopman, J.L.A. van de Snepscheut, 'The Twisted Cube,' in J. Bakker, A. Nijman, P. Treleaven, eds., PARLE: Parallel Architectures and Languages Europe, Vol. I: Parallel Architectures, Springer, pp. 152-159, 1987
  10. K. Efe, 'The crossed cube architecture for parallel computation,' IEEE Trans. on Parallel and DisSystems 3(5), pp. 513-524, 1992 https://doi.org/10.1109/71.159036
  11. K. Efe, 'A variation on the hypercube with lower diameter,' IEEE Trans. on Computers 40(11), pp. 1312-1316, 1991 https://doi.org/10.1109/12.102840
  12. P. Cull and S. Larson, 'The Mobius cubes,' in Proc. of the 6th IEEE Distributed Memory Computing Conf., pp. 699-702, 1991
  13. N.K Singhvi and K Ghose, 'The Mcube: a symmetrical cube based network with twisted links,' in Proc. of the 9th IEEE Int. Parallel Processing Symposium IP PS 1995, pp. 11-16, 1995 https://doi.org/10.1109/IPPS.1995.395907
  14. F.B. Chedid, 'On the generalized twisted cube,' Inform Proc. Lett. 55, pp. 49-52, 1995 https://doi.org/10.1016/0020-0190(95)00054-G
  15. J.-H. Park and KY. Chwa, 'Recursive circulants and their embeddings among hypercubes,' TheoComputer Science 244, pp. 35-62, 2000 https://doi.org/10.1016/S0304-3975(00)00176-6
  16. A.-H. Esfahanian, L.M. Ni, and B.E. Sagan, 'The twisted $n$-cube with application to multiprocessing,' IEEE Trnas. Computers 40(1), pp. 88-93, 1991 https://doi.org/10.1109/12.67323
  17. T.-Y. Sung, C.-Y. Lin, Y.-C. Chuang, and L.-H. Hsu, 'Fault tolerant token ring embedding in double loop networks,' Inform Proc. Lett. 66, pp. 201-207, 1998 https://doi.org/10.1016/S0020-0190(98)00066-0
  18. A. Sengupta, 'On ring embedding in hypercubes with faulty nodes and links,' Inform Proc. Lett. 68, pp. 207-214, 1998 https://doi.org/10.1016/S0020-0190(98)00159-8
  19. Y.-C. Tseng, S.-H. Chang, and J.-P. Sheu, 'Fault-tolerant ring embedding in a star graph with both link and node failures,' IEEE Trans. Parallel and Distributed Systems 8(12), pp. 1185-1195, Dec. 1997 https://doi.org/10.1109/71.640010
  20. A.S. Vaidya, P.S.N. Rao, S.R. Shankar, 'A class of hypercube-like networks,' in Proc. of the 5th IEEE Symposium on Parallel and Distributed Processing SPDP 1993, pp. 800-803, Dec. 1993 https://doi.org/10.1109/SPDP.1993.395450
  21. C.-D. Park and KY. Chwa, 'Hamiltonian properties on the class of hypercube-like networks,' Iriform Proc. Lett. 91, pp. 11-17, 2004 https://doi.org/10.1016/j.ipl.2004.03.009
  22. H.-S. Lim, H.-C. Kim, and J.-H. Park, 'Hypohaand pancyclicity of hyperinterconnection networks,' in Proc. Korea-Japan Joint Workshop on Algorithms and Computation WAAC 2005, Seoul, Aug. 2005