Embedding paths of variable lengths into hypercubes with conditional link-faults
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
454 | en_US |
dc.citation.issue |
8-9 | en_US |
dc.citation.spage |
441 | en_US |
dc.citation.volume |
35 | en_US |
dc.citation.woscount |
9 | |
dc.contributor.author |
Kueng, Tz-Liang | en_US |
dc.contributor.author |
Lin, Cheng-Kuan | en_US |
dc.contributor.author |
Liang, Tyne | en_US |
dc.contributor.author |
Tan, Jimmy J. M. | en_US |
dc.contributor.author |
Hsu, Lih-Hsing | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:09:01Z | |
dc.date.available |
2014-12-08T15:09:01Z | |
dc.date.issued |
2009-08-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.doi |
10.1016/j.parco.2009.06.002 | en_US |
dc.identifier.issn |
0167-8191 | en_US |
dc.identifier.journal |
PARALLEL COMPUTING | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.parco.2009.06.002 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/6869 | |
dc.identifier.wosnumber |
WOS:000270704500002 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Interconnection network | en_US |
dc.subject |
Hypercube | en_US |
dc.subject |
Fault tolerance | en_US |
dc.subject |
Conditional fault | en_US |
dc.subject |
Linear array | en_US |
dc.subject |
Path embedding | en_US |
dc.title |
Embedding paths of variable lengths into hypercubes with conditional link-faults | en_US |
dc.type |
Article | en_US |
檔案
- 000270704500002.pdf (432.2 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Kueng, T.-L., Lin, C.-K., Liang, T., Tan, J. J. M., & Hsu, L.-H. (2009). Embedding paths of variable lengths into hypercubes with conditional link-faults. PARALLEL COMPUTING, 35(8-9), 441–454. https://doi.org/10.1016/j.parco.2009.06.002
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/6869