Embedding paths of variable lengths into hypercubes with conditional link-faults

Tz-Liang Kueng, Cheng-Kuan Lin, Tyne Liang, Jiann-Mean Tan, Lih-Hsing Hsu

Research output: Contribution to journalArticlepeer-review

15 Scopus citations


Faults in a network may take various forms such as hardware failures while a node or a link stops functioning, software errors, or even missing of transmitted packets. In this paper, we study the link-fault-tolerant capability of an n-dimensional hypercube (n-cube for short) with respect to path embedding of variable lengths in the range from the shortest to the longest. Let F be a set consisting of faulty links in a wounded n-cube Q(n), in which every node is still incident to at least two fault-free links. Then we show that Q(n) - F has a path of any odd (resp. even) length in the range from the distance to 2(n) - 1 (resp. 2(n) - 2) between two arbitrary nodes even if vertical bar F vertical bar = 2n - 5. In order to tackle this problem, we also investigate the fault diameter of an n-cube with hybrid node and link faults. (C) 2009 Elsevier B.V. All rights reserved.
Original languageEnglish
Pages (from-to)441-454
Number of pages14
JournalParallel Computing
Issue number8-9
StatePublished - Aug 2009


  • Interconnection network; Hypercube; Fault tolerance; Conditional fault; Linear array; Path embedding

Fingerprint Dive into the research topics of 'Embedding paths of variable lengths into hypercubes with conditional link-faults'. Together they form a unique fingerprint.

Cite this