Fault-tolerant wormhole routing algorithm for mesh networks
Journal
IEE Proceedings: Computers and Digital Techniques
Journal Volume
147
Journal Issue
1
Pages
9-14
Date Issued
2000-01
Date
2000-01
Author(s)
Sui, P.H.
Abstract
A 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.
Other Subjects
Algorithms; 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 systems
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00842724.pdf
Size
330.43 KB
Format
Adobe PDF
Checksum
(MD5):d15e7aa77cd6175d1b600e4712e94794