Fault-tolerant routing and disjoint paths in dual-cube: a new interconnection network
In this paper, we introduce a new interconnection network, the dual-cube, its topological properties, and the routing/broadcasting algorithms in the dual-cube. The advanced subjects such as fault-tolerant routing and constructing multiple disjoint paths in dual-cubes are also included in this paper....
Gespeichert in:
| Veröffentlicht in: | Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001 S. 315 - 322 |
|---|---|
| Hauptverfasser: | , |
| Format: | Tagungsbericht |
| Sprache: | Englisch Japanisch |
| Veröffentlicht: |
IEEE
13.11.2002
|
| Schlagworte: | |
| ISBN: | 0769511538, 9780769511535 |
| ISSN: | 1521-9097 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In this paper, we introduce a new interconnection network, the dual-cube, its topological properties, and the routing/broadcasting algorithms in the dual-cube. The advanced subjects such as fault-tolerant routing and constructing multiple disjoint paths in dual-cubes are also included in this paper. The binary hypercube, or r-cube, can connect 2/sup r/ nodes. In contrast, a dual-cube with r links for each node, F/sub r/, can connect 2/sup 2r-1/ nodes while keeps most of topological properties of hypercubes. Fault-tolerant routing and constructing multiple disjoint paths in dual-cubes can be solved elegantly using a new structure, called extended cube. We show that for any two nonfaulty nodes s and t in F/sub r/ which contains up to r-1 faulty nodes, we can find a fault-free path s to t, of length at most 3d(s,t) in O(r) optimal time, where d(s,t) is the distance between s and t. We also show that, in a fault-free F/sub r/, r disjoint paths s to t, of length at most d(s,t)+6 can be constructed in O(r/sup 2/) optimal time. |
|---|---|
| AbstractList | In this paper, we introduce a new interconnection network, the dual-cube, its topological properties, and the routing/broadcasting algorithms in the dual-cube. The advanced subjects such as fault-tolerant routing and constructing multiple disjoint paths in dual-cubes are also included in this paper. The binary hypercube, or r-cube, can connect 2/sup r/ nodes. In contrast, a dual-cube with r links for each node, F/sub r/, can connect 2/sup 2r-1/ nodes while keeps most of topological properties of hypercubes. Fault-tolerant routing and constructing multiple disjoint paths in dual-cubes can be solved elegantly using a new structure, called extended cube. We show that for any two nonfaulty nodes s and t in F/sub r/ which contains up to r-1 faulty nodes, we can find a fault-free path s to t, of length at most 3d(s,t) in O(r) optimal time, where d(s,t) is the distance between s and t. We also show that, in a fault-free F/sub r/, r disjoint paths s to t, of length at most d(s,t)+6 can be constructed in O(r/sup 2/) optimal time. |
| Author | Yamin Li Shietung Peng |
| Author_xml | – sequence: 1 surname: Yamin Li fullname: Yamin Li organization: Fac. of Comput. & Inf. Sci., Hosei Univ., Tokyo, Japan – sequence: 2 surname: Shietung Peng fullname: Shietung Peng |
| BookMark | eNot0FtLwzAcBfCAE1ynX2BP-QKtuTRt49uot8FAQX0e_9w0syYjTRl-ewvz6cDv4Rw4BVqEGCxCa0oqSom83favm_u3ihFCK8nrjosLVJC2kYJSwbsFWlLBaCmJbK9QMY4HQhjhgizRxyNMQy5zHGyCkHGKU_bhE0Mw2PjxEP2MR8hfI_YBmwmGUk_K3mHAwZ5myzbpGILV2ccwWz7F9H2NLh0Mo735z9W88_DeP5e7l6dtv9mVnkqZS2caqwVIcHXdaqEdZ6qtG8NbTYWVwIzSnLvOcaWUaxg1rCYOasegVY2SfIXW515vrd0fk_-B9Ls_P8D_ADhPVDI |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ICPADS.2001.934835 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EndPage | 322 |
| ExternalDocumentID | 934835 |
| GroupedDBID | 23M 29O 6IE 6IF 6IH 6IK 6IL 6IM 6IN AAJGR AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IPLJI OCL RIE RIL RNS |
| ID | FETCH-LOGICAL-i199t-fd6ec5a9af447c5cf32b746d37c15e9a2dbc33f8f3bbbf621d240fa4f2a7b6b93 |
| IEDL.DBID | RIE |
| ISBN | 0769511538 9780769511535 |
| ISICitedReferencesCount | 13 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000170063200042&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1521-9097 |
| IngestDate | Tue Aug 26 18:49:05 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English Japanese |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i199t-fd6ec5a9af447c5cf32b746d37c15e9a2dbc33f8f3bbbf621d240fa4f2a7b6b93 |
| PageCount | 8 |
| ParticipantIDs | ieee_primary_934835 |
| PublicationCentury | 2000 |
| PublicationDate | 2002-11-13 |
| PublicationDateYYYYMMDD | 2002-11-13 |
| PublicationDate_xml | – month: 11 year: 2002 text: 2002-11-13 day: 13 |
| PublicationDecade | 2000 |
| PublicationTitle | Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001 |
| PublicationTitleAbbrev | ICPADS |
| PublicationYear | 2002 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0020350 ssj0000451545 |
| Score | 1.5674914 |
| Snippet | In this paper, we introduce a new interconnection network, the dual-cube, its topological properties, and the routing/broadcasting algorithms in the dual-cube.... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 315 |
| SubjectTerms | Casting Computer networks Concurrent computing Electronic mail Fault tolerance Fault tolerant systems Hypercubes Intelligent networks Multiprocessor interconnection networks Routing |
| Title | Fault-tolerant routing and disjoint paths in dual-cube: a new interconnection network |
| URI | https://ieeexplore.ieee.org/document/934835 |
| WOSCitedRecordID | wos000170063200042&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFA9uePA0nRO_ycFrtqXNx-JNpkNBxkCF3UY-oTJa6Vr_fpO02xC8eCntOzQhj_DeS97v9wPgLpCKGV-xIawxQUT6h-BjhxwdGxq096iLnn7l8_lkuRSLlmc7YmGstbH5zA7Da7zLN4Wuw1HZSKTEJwwd0OGcNVCt3XFKoEmhZE-zFy7MIlVq7EAI7H-hYvfpRNjhLfHO9ptuwTRjMXqZLh4e30LdiIfNcL9kV2LUmfX-Nd9jMNij9-BiF5dOwIHN-6C3lW-A7W4-BR8zWa8rVBVr6wNWBcuiDj3QUOYGmmzzWWTeGBSLNzDLYcBsIV0rew8l9Lk4DEQTpQ59MhEa4W2xoXzg__v0Pn1GrcoCyrAQFXKGWU2lkI4Qrql2aaI4YSblGlMrZGKUTlM3calSyrEEG58EOElcIrliSqRnoJsXuT0HUHBpsLdY72OiFZNGMMWo1kQbzoi8AP2wSKuvhkhj1azP5Z_WK3DUCK9ghNNr0K3K2t6AQ_1dZZvyNjr_B0c7qp8 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFA86BT1N58Rvc_CabWmTdvEm07HhHAMn7DbyCZXRStf695uk3YbgxUtp36EJ-eC9l7zf7wfAgyMVUzZjQ1higgi3Dxb3DDK0p6jT3qPGz_Qknk77iwWb1TzbHgujtfbFZ7rjXv1dvspk6Y7KuiwkNmDYBweUkKBXgbW2ByqOKIWSHdGeuzLzZKm-BsHx_7mc3QYUbo_X1Dubb7qB0_RYdzyYPT2_u8wRd6oGfwmveL8zbP6rxyegvcPvwdnWM52CPZ22QHMj4ADr_XwGPoa8XBWoyFbauqwC5lnpqqAhTxVUyfozS6zRaRavYZJCh9pCshT6EXJoo3HoqCZy6SplPDjC2nxJedv-92U-GKFaZwElmLECGRVpSTnjhpBYUmnCQMQkUmEsMdWMB0rIMDR9EwohTBRgZcMAw4kJeCwiwcJz0EizVF8AyGKusLVoO8tEiogrFomISkmkiiPCL0HLDdLyq6LSWFbjc_Wn9R4cjeZvk-VkPH29BseVDAtGOLwBjSIv9S04lN9Fss7v_EL4AVj9reY |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings.+Eighth+International+Conference+on+Parallel+and+Distributed+Systems.+ICPADS+2001&rft.atitle=Fault-tolerant+routing+and+disjoint+paths+in+dual-cube%3A+a+new+interconnection+network&rft.au=Yamin+Li&rft.au=Shietung+Peng&rft.date=2002-11-13&rft.pub=IEEE&rft.isbn=9780769511535&rft.issn=1521-9097&rft.spage=315&rft.epage=322&rft_id=info:doi/10.1109%2FICPADS.2001.934835&rft.externalDocID=934835 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1521-9097&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1521-9097&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1521-9097&client=summon |