Full metadata record
DC FieldValueLanguage
dc.contributor.authorLo, CCen_US
dc.contributor.authorChiou, CYen_US
dc.date.accessioned2014-12-08T15:46:09Z-
dc.date.available2014-12-08T15:46:09Z-
dc.date.issued1999-10-15en_US
dc.identifier.issn0140-3664en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0140-3664(99)00118-8en_US
dc.identifier.urihttp://hdl.handle.net/11536/31032-
dc.description.abstractThe asynchronous transfer mode (ATM) is the transfer mode recommended for the broad integrated service digital network (B-ISDN) by ITU-T. In this paper, we propose a self-routing fault-tolerant switching architecture for ATM networks. The proposed architecture uses subswitches and extra links to provide alternative paths; hence, can tolerate multiple faults. Analytical results show that the total number of redundant paths increases exponentially as the size of the network increases. A simulation model is developed. Simulation results indicate that the proposed architecture is much more fault-tolerant and cost-effective than those architectures found in the literature. Simulation results also illustrate that the proposed architecture still maintains a high throughput with an acceptable cell delay time, even when the number of faulty elements increases. (C) 1999 Elsevier Science B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectfault-toleranten_US
dc.subjectredundant pathen_US
dc.subjectsurvival probabilityen_US
dc.subjectcost-effectiveness ratioen_US
dc.subjectthroughputen_US
dc.subjectcell delayen_US
dc.titleA fault-tolerant architecture for ATM networksen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0140-3664(99)00118-8en_US
dc.identifier.journalCOMPUTER COMMUNICATIONSen_US
dc.citation.volume22en_US
dc.citation.issue17en_US
dc.citation.spage1540en_US
dc.citation.epage1548en_US
dc.contributor.department資訊管理與財務金融系 註:原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:000083478500002-
dc.citation.woscount0-
Appears in Collections:Articles


Files in This Item:

  1. 000083478500002.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.