On Reliability Analysis of Forward Loop Forward Hop Networks
A common technique to improve the reliability of loop (or ring) networks is by introducing link redundancy; that is, by providing several alternative paths for communication between pairs of nodes. With alternative paths between nodes, the network can now sustain several node and link failures by bypassing the faulty components. However, faults occurring at strategic locations in a ring can prevent the computation by disrupting I/O operations, blocking the flow of information, or even segmenting the structure into pieces which can no longer be suitable for any practical purpose.
An extensive characterization of fault-tolerance in FLFH networks is given in this paper. The characterization has revealed several properties which describe the problem of constructing subrings and linear arrays in the presence of node failures in the FLFH network for a specific link configuration. Also in this paper, bounds are established on the degree of fault tolerance achievable in a redundant FLFH network when performing a computation that requires a fixed number of operational nodes. Also the bounds on the size of the problems guaranteed to be solved in the presence of a given number of faults in the network are derived.
KeywordsLinear Array Fault Tolerance Link Failure Node Failure Fault Pattern
Unable to display preview. Download preview PDF.
- 3.Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: 2/e Introduction to Algorithms. MIT Press, CambridgeGoogle Scholar
- 5.Granov, A., Kleinrock, L., Gerla, M.: A highly reliable distributed double loop network architecture. In: Proc. Intl. Symp. on Fault-Tolerant Computing, Kyoto, October 1980, pp. 319–324 (1980)Google Scholar
- 14.Wedde, H.F., Tjoie, P.H.L.: Long-term reconfiguration of double ring networks under real time constraints. In: Proc. Real-Time Systems Symp, pp. 104–111 (1987)Google Scholar