Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arden, B., Lee, H.: Analysis of chordal ring networks. IEEE Trans. Computers C-30(4), 291–295 (1981)
Bruck, J., Cypher, R., Ho, C.-T.: Fault-tolerant meshes and hypercubes with minimal number of spares. IEEE Trans. Computers C-42, 1089–1104 (1993)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: 2/e Introduction to Algorithms. MIT Press, Cambridge
Du, D.Z., Hsu, D.F., Hwang, F.K.: Doubly linked ring networks. IEEE Trans. Computers C-34(9), 853–855 (1985)
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)
Maity, S., Nayak, A., Roy, B.: On Characterization of Catastrophic Faults in Two-Dimensional VLSI Arrays. INTEGRATION, The VLSI Journal 38, 267–281 (2004)
Maity, S., Roy, B., Nayak, A.: On Enumeration of Catastrophic Fault Patterns. Information Processing Letters 81, 209–212 (2002)
Maity, S., Roy, B., Nayak, A.: Identification of optimal link redundancy for which a given fault pattern is catastrophic in VLSI linear arrays. Congr. Numer. 151, 41–52 (2001)
Masuyama, H., Icimori, T.: Tolerance of doulbe-loop computer networks to multinode failures. IEEE Trans. Computers C-38(5), 738–741 (1989)
Nayak, A., Pagli, L., Santoro, N.: Efficient construction of catastrophic patterns for VLSI reconfigurable arrays. INTEGRATION: The VLSI Journal 15, 133–150 (1993)
Peha, J.M., Tobagi, F.A.: Comments on tolerance of double-loop networks with multinode failures. IEEE Trans. Computers C-41(11), 1488–1490 (1992)
Raghavendra, C.S.: Fault tolerance in regular network architectures. IEEE Micro 4(6), 44–53 (1884)
Tyszer, J.: A multiple fault-tolerant processor network architecture for pipeline computing. IEEE Trans. Computers C-37(11), 1414–1418 (1988)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maity, S., Ramsundar, S. (2006). On Reliability Analysis of Forward Loop Forward Hop Networks. In: Madria, S.K., Claypool, K.T., Kannan, R., Uppuluri, P., Gore, M.M. (eds) Distributed Computing and Internet Technology. ICDCIT 2006. Lecture Notes in Computer Science, vol 4317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11951957_13
Download citation
DOI: https://doi.org/10.1007/11951957_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68379-7
Online ISBN: 978-3-540-68380-3
eBook Packages: Computer ScienceComputer Science (R0)