Embedding Paths of Variable Lengths into Hypercubes with Conditional Link-faults

ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 > Item 310904400/18634

請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/18634

題名:	Embedding Paths of Variable Lengths into Hypercubes with Conditional Link-faults
作者:	龔自良;Kung, Tzu-Liang;Kueng, Tz-Liang
貢獻者:	資訊工程學系
關鍵詞:	Interconnection network;Hypercube;Fault tolerance;Conditional fault;Linear array;Path embedding
日期:	2009-09
上傳時間:	2012-11-26 05:56:16 (UTC+0)
摘要:	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 Qn, in which every node is still incident to at least two fault-free links. Then we show that Qn-F has a path of any odd (resp. even) length in the range from the distance to 2n-1 (resp. 2n-2) between two arbitrary nodes even if \|F\|=2n-5. In order to tackle this problem, we also investigate the fault diameter of an n-cube with hybrid node and link faults.
關聯:	PARALLEL COMPUTING;35(8–9): 441–454
顯示於類別:	[資訊工程學系] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	405	檢視/開啟

在ASIAIR中所有的資料項目都受到原著作權保護.