完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChen, Ching-Wen
dc.contributor.authorFu, Shih-Chang
dc.date.accessioned2009-06-02T08:41:42Z
dc.date.accessioned2020-07-05T06:32:13Z-
dc.date.available2009-06-02T08:41:42Z
dc.date.available2020-07-05T06:32:13Z-
dc.date.issued2006-06-13T07:44:40Z
dc.date.submitted2003-12-19
dc.identifier.urihttp://dspace.fcu.edu.tw/handle/2376/1797-
dc.description.abstractIn the design of fault-tolerant on interconnection networks, disjoint paths and dynamic rerouting are often used to tolerate faults. If a fault is known before the packet is sent, one of the different disjoint paths can be chosen to tolerate the faulty switches or links. Otherwise, a dynamic rerouting scheme is needed to tolerate the faulty switches or links dynamically. In this paper, we address the dynamic rerouting problem and present a network to tolerate faults. Besides guaranteeing one fault tolerance, the rerouting method minimizes the number of extra links traversed in finding such an alternative path. Furthermore, to tolerate multiple faults, we analysis the dynamic rerouting method and then propose another network to provide an alternative path at each stage when a switch or link is faulty or busy. By the result of comparisons among some important dynamic rerouting networks, our work performs well in fault-tolerant capability, rerouting hops, and hardware cost
dc.description.sponsorship逢甲大學,台中市  
dc.format.extent8P.
dc.format.extent262493 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries中華民國92年全國計算機會議
dc.subjectGamma interconnection network
dc.subjectdisjoint paths
dc.subjectdynamic rerouting
dc.subjectfault-tolerant
dc.subjectGIN
dc.subjectbacktracking
dc.subject.other網路和IPv6 
dc.titleDesign of Fault-Tolerant Interconnection Networks with Minimal Rerouting Hops
dc.title.alternative最少額外鏈結數的重新繞路容錯互聯網路之設計
分類:2003年 NCS 全國計算機會議

文件中的檔案:
檔案 描述 大小格式 
OT_0012003212.pdf256.34 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。