On Reliability Analysis of Forward Loop Forward Hop Networks

  • Soumen Maity
  • S. Ramsundar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4317)


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.


Linear Array Fault Tolerance Link Failure Node Failure Fault Pattern 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arden, B., Lee, H.: Analysis of chordal ring networks. IEEE Trans. Computers C-30(4), 291–295 (1981)CrossRefMathSciNetGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: 2/e Introduction to Algorithms. MIT Press, CambridgeGoogle Scholar
  4. 4.
    Du, D.Z., Hsu, D.F., Hwang, F.K.: Doubly linked ring networks. IEEE Trans. Computers C-34(9), 853–855 (1985)CrossRefMathSciNetGoogle Scholar
  5. 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
  6. 6.
    Maity, S., Nayak, A., Roy, B.: On Characterization of Catastrophic Faults in Two-Dimensional VLSI Arrays. INTEGRATION, The VLSI Journal 38, 267–281 (2004)CrossRefGoogle Scholar
  7. 7.
    Maity, S., Roy, B., Nayak, A.: On Enumeration of Catastrophic Fault Patterns. Information Processing Letters 81, 209–212 (2002)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    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)MATHMathSciNetGoogle Scholar
  9. 9.
    Masuyama, H., Icimori, T.: Tolerance of doulbe-loop computer networks to multinode failures. IEEE Trans. Computers C-38(5), 738–741 (1989)CrossRefGoogle Scholar
  10. 10.
    Nayak, A., Pagli, L., Santoro, N.: Efficient construction of catastrophic patterns for VLSI reconfigurable arrays. INTEGRATION: The VLSI Journal 15, 133–150 (1993)MATHCrossRefGoogle Scholar
  11. 11.
    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)CrossRefGoogle Scholar
  12. 12.
    Raghavendra, C.S.: Fault tolerance in regular network architectures. IEEE Micro 4(6), 44–53 (1884)CrossRefGoogle Scholar
  13. 13.
    Tyszer, J.: A multiple fault-tolerant processor network architecture for pipeline computing. IEEE Trans. Computers C-37(11), 1414–1418 (1988)CrossRefGoogle Scholar
  14. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Soumen Maity
    • 1
  • S. Ramsundar
    • 2
  1. 1.Department of MathematicsIndian Institute of Technology GuwahatiGuwahatiIndia
  2. 2.Computer Science & EngineeringIndian Institute of Technology GuwahatiGuwahatiIndia

Personalised recommendations