We present an adaptive fault-tolerant wormhole routing algorithm for hypercubes by using 3 virtual networks. The routing algorithm can tolerate at least n -1 faulty nodes and can route a message via a path of length no more than the shortest path plus four. Previous algorithms which achieve the same
Regularizers for fault tolerant multilayer feedforward networks
โ Scribed by Shue Kwan Mak; Pui-Fai Sum; Chi-Sing Leung
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 771 KB
- Volume
- 74
- Category
- Article
- ISSN
- 0925-2312
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A new family of almost regular interconnection topology is proposed that can be defined for an arbitrary number of nodes. The proposed network can be very efficiently used to design communication architecture for distributed systems with an arbitrary number of computing nodes. The design involves a
## Abstract This article deals with the design of networks to be placed on satellites. These networks should connect inputs (corresponding to signals arriving at the satellite) to outputs (corresponding to amplifiers, also called Traveling Wave Tube Amplifiers (TWTA)), even in case of failures of a