Publications-Periodical Articles
Article View/Open
Publication Export
Google ScholarTM
NCCU Library
Citation Infomation
Related Publications in TAIR
| Title | Routing Properties of Supercubes |
| Creator | 許志堅 Sheu, Jyh-Jian ; Tan, Jimmy J.M. ; Hsu, Lih-Hsing |
| Contributor | 傳播學院 |
| Key Words | Interconnection networks; Hypercube; Supercube; Container; Wide diameter; Fault diameter |
| Date | 2001.10 |
| Date Issued | 25-Jun-2014 17:13:12 (UTC+8) |
| Summary | 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. |
| Relation | Information Sciences, 131(1-4), 107-128 |
| Type | article |
| dc.contributor | 傳播學院 | en_US |
| dc.creator (作者) | 許志堅 | zh_TW |
| dc.creator (作者) | Sheu, Jyh-Jian ; Tan, Jimmy J.M. ; Hsu, Lih-Hsing | en_US |
| dc.date (日期) | 2001.10 | en_US |
| dc.date.accessioned | 25-Jun-2014 17:13:12 (UTC+8) | - |
| dc.date.available | 25-Jun-2014 17:13:12 (UTC+8) | - |
| dc.date.issued (上傳時間) | 25-Jun-2014 17:13:12 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/66929 | - |
| dc.description.abstract (摘要) | 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. | en_US |
| dc.format.extent | 347373 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Information Sciences, 131(1-4), 107-128 | en_US |
| dc.subject (關鍵詞) | Interconnection networks; Hypercube; Supercube; Container; Wide diameter; Fault diameter | en_US |
| dc.title (題名) | Routing Properties of Supercubes | en_US |
| dc.type (資料類型) | article | en |