Embedding paths of variable lengths into hypercubes with conditional link-faults
檔案
- 000270704500002.pdf (432.2 KB, Adobe PDF)
日期
2009-08-01
類型
系所
期刊名稱
PARALLEL COMPUTING
卷期與頁次
第 35 卷第 8-9 期,頁 441–454
ISSN
0167-8191
語言
英文
摘要
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.
所屬典藏
期刊論文引用此條目
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