Skip to main content
Springer Nature Link
Log in

On Reliability Analysis of Forward Loop Forward Hop Networks

  • Conference paper
Distributed Computing and Internet Technology (ICDCIT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4317))

  • 493 Accesses

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 to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Arden, B., Lee, H.: Analysis of chordal ring networks. IEEE Trans. Computers C-30(4), 291–295 (1981)

    Article  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  3. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: 2/e Introduction to Algorithms. MIT Press, Cambridge

    Google Scholar 

  4. Du, D.Z., Hsu, D.F., Hwang, F.K.: Doubly linked ring networks. IEEE Trans. Computers C-34(9), 853–855 (1985)

    Article  MathSciNet  Google 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 

  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)

    Article  Google Scholar 

  7. Maity, S., Roy, B., Nayak, A.: On Enumeration of Catastrophic Fault Patterns. Information Processing Letters 81, 209–212 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    MATH  MathSciNet  Google Scholar 

  9. Masuyama, H., Icimori, T.: Tolerance of doulbe-loop computer networks to multinode failures. IEEE Trans. Computers C-38(5), 738–741 (1989)

    Article  Google Scholar 

  10. Nayak, A., Pagli, L., Santoro, N.: Efficient construction of catastrophic patterns for VLSI reconfigurable arrays. INTEGRATION: The VLSI Journal 15, 133–150 (1993)

    Article  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  12. Raghavendra, C.S.: Fault tolerance in regular network architectures. IEEE Micro 4(6), 44–53 (1884)

    Article  Google Scholar 

  13. Tyszer, J.: A multiple fault-tolerant processor network architecture for pipeline computing. IEEE Trans. Computers C-37(11), 1414–1418 (1988)

    Article  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 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology Guwahati, Guwahati, 781 039, Assam, India

    Soumen Maity

  2. Computer Science & Engineering, Indian Institute of Technology Guwahati, Guwahati, 781 039, Assam, India

    S. Ramsundar

Authors
  1. Soumen Maity
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Ramsundar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Missouri-Rolla, USA

    Sanjay K. Madria

  2. MIT Lincoln Laboratories,  

    Kajal T. Claypool

  3. Dept of CS, Louisiana State University, 70803, Baton Rouge, LA

    Rajgopal Kannan

  4. Department of Computer Science, Radford University, 24060, Radford, VA, USA

    Prem Uppuluri

  5. Department of Computer Science and Engineering, Motilal Nehru National Institute of Technology, Allahabad, India

    Manoj Madhava Gore

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics