Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/66929
題名: | Routing Properties of Supercubes | 作者: | 許志堅 Sheu, Jyh-Jian ; Tan, Jimmy J.M. ; Hsu, Lih-Hsing |
貢獻者: | 傳播學院 | 關鍵詞: | Interconnection networks; Hypercube; Supercube; Container; Wide diameter; Fault diameter | 日期: | 2001 | 上傳時間: | 25-六月-2014 | 摘要: | Usually each vertex of the (s+1)-dimensional hypercube is labeled with a unique integer k with 0⩽k⩽2s+1−1. The supercube SN of N nodes with 2s<N⩽2s+1 is constructed by merging nodes u and u−2s, with N⩽u⩽2s+1−1, in the (s+1)-dimensional hypercube into a single node labeled as u−2s and leaving other nodes in the (s+1)-dimensional hypercube unchanged. In this paper, we give the exact distance between any two nodes of supercube and present a new shortest path routing algorithm on SN. Then we show how to construct κ(SN) disjoint paths between any two nodes of the supercube, where κ(SN) is the connectivity of SN. Finally, we compute the wide diameter and the fault diameter of SN. We show that both the wide diameter and the fault diameter are equal to s+2 if N∈{2s+1−2i+1∣0⩽i⩽s−1} and s+1 otherwise. | 關聯: | Information Sciences, 131(1-4), 107-128 | 資料類型: | article |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
107-128.pdf | 339.23 kB | Adobe PDF2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.