Dept. of Electr. Eng., National Taiwan Univ.Sui, P.H.P.H.SuiSHENG-DE WANG2007-04-192018-07-062007-04-192018-07-062000-0113502387http://ntur.lib.ntu.edu.tw//handle/246246/200704191001010https://www.scopus.com/inward/record.uri?eid=2-s2.0-0033876475&doi=10.1049%2fip-cdt%3a20000187&partnerID=40&md5=c09c0980462adf0900c30c758c137cb2A multicomputer system can hardly avoid having faulty components in the real world. A good fault-tolerant routing scheme should tolerate as many fault patterns as possible and, hence, reduce the number of disabled functional nodes. The authors consider disconnected unsurrounded faults, i.e. all disconnected faults discussed in the literature. In disconnected unsurrounded fault models, there is no restriction on the shapes of faults. In the proposed routing scheme, a message always leaves each f-ring encountered at an appropriate node such that no message will encounter the same f-ring again and therefore never get trapped in faults.application/pdf338359 bytesapplication/pdfen-USAlgorithms; Computer networks; Digital computers; Fault tolerant computer systems; Mathematical models; Multiprocessing systems; Real time systems; Mesh networks; Multicomputer system; Network latency; Routing algorithm; Data communication systemsjournal article10.1049/ip-cdt:200001872-s2.0-0033876475http://ntur.lib.ntu.edu.tw/bitstream/246246/200704191001010/1/00842724.pdf