Advertisement

Fault-tolerance for Switching Networks

Chapter
Part of the Network Theory and Applications book series (NETA, volume 5)

Abstract

Switching networks (SNs) are typically placed at the center of the systems they serve. Consequently, if an SN fails, system performance is bound to deteriorate or, in the worst case, the system may collapse totally. To limit these troubling consequences, the SN has to be fault tolerant [11]. Loosely defined, a fault tolerant SN is a SN that can still work in the presence of faults. Unfortunately, there is no universal, unique definition which can be applied to a network to see whether it is fault tolerant or not. To a great extent, fault tolerance is “in the eyes of the designer!” Specifically, a designer arbitrarily sets for the network in question a fault tolerance model [3, 4], defining what a fault is, how many such faults the network can (or should) tolerate, and exactly what is meant by “tolerate.”

Keywords

Fault Model Interconnection Network Faulty Condition Link Pattern Clos Network 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    G. Adams and H. Siegel, The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems, IEEE Transactions on Computers, vol. C-31, no. 5 (1982) pp. 443–454.CrossRefGoogle Scholar
  2. [2]
    G. Adams and H. Siegel, Modifications to Improve the Fault Tolerance of the Extra Stage Cube Interconnection Network, Proceedings of the 1984 International Conference on Parallel Processing, 1984, pp. 169–173.Google Scholar
  3. [3]
    G. Adams, D. Agrawal and H. Siegel, A Survey and Comparison of Fault-tolerant Multistage Interconnection Networks, Computer, June 1987, pp. 14–27.Google Scholar
  4. [4]
    D. Agrawal, Testing and Fault Tolerance of Multistage Interconnection Networks, Computer, April 1982, pp. 41–53.Google Scholar
  5. [5]
    J. D. Carpinelli and A. Y. Oruc, Parallel Set-Up Algorithms for Clos Networks Using a Tree-Connected Computer, Proceedings of the 2nd International Conference on Supercomputing, May, 1987 pp. 321–327.Google Scholar
  6. [6]
    J. D. Carpinelli and C. B. Wang, Performance of a New Decomposition Algorithm for Rearrangeble Fault-tolerant Clos Interconnection Networks under Sub-maximal and No-fault Conditions, in D. -Z Du and F. K. Hwang (eds.) Advances in Switching Networks(American Mathematical Society, 1997 ) pp. 103–117.Google Scholar
  7. [7]
    P. Chauang, CGIN: A Fault Tolerant Modified Gamma Interconnection Network, IEEE Transactions on Parallel and Distributed Systems, vol7, no. 12 (1996) pp. 1301–1306.CrossRefGoogle Scholar
  8. [8]
    L. Ciminiera and A. Serra, A Connecting Network with Fault Tolerance Capabilities, IEEE Transactions on Computers, vol. C-35, no. 6 (1986) pp. 578–580.CrossRefGoogle Scholar
  9. [9]
    C. Clos, A Study of Nonblocking Switching Networks, Bell Systems Technical Journal, vol. 32, no. 2 (1953), pp. 406–424.Google Scholar
  10. [10]
    T. Feng and C. Wu, Fault-Diagnosis for a Class of Multistage Interconnection Networks, IEEE Transactions on Computers, vol. C-30, no. 10 (1981), pp. 743–758.MathSciNetCrossRefGoogle Scholar
  11. [11]
    I. Gazit and M. Malek, Fault Tolerance Capabilities in Multistage Network-Based Multicomputer Systems, IEEE Transactions on Computers, vol. 37, no. 7 (1988) pp. 788–798.CrossRefGoogle Scholar
  12. [12]
    M. Jeng and H. Siegel, A Fault-Tolerant Multistage Interconnection Network for the Multiprocessor Systems Using Dynamic Redundancy, Proceedings of the 6th International Conference on Distributed Computing Systems, 1986, pp. 70–77.Google Scholar
  13. [13]
    C. Kruskal and M. Snir, The Performance of Multistage Interconnection Networks for Multiprocessors, IEEE Transactions on Computers, vol. C-32, no. 12, December 1983, pp. 1091–1098.CrossRefGoogle Scholar
  14. [14]
    V. Kumar and S. Reddy, Augmented Shuffle-exchange Multistage Interconnection Network, Computer, June 1987, pp. 30–40.Google Scholar
  15. [15]
    H. Lee, F. K. Hwang and J. D. Carpinelli, A New Decomposition Algorithm for Rearrangeble Clos Interconnection Networks, IEEE Transactions on Communications, vol. 44, no. 11 (1996) pp. 1572–1578.CrossRefGoogle Scholar
  16. [16]
    W. Lin and C. Wu, Design of a 2x2 Fault-Tolerant Switching Element, Proceedings of the 9th Annual Symposium on Computer Architecture, 1982, pp. 181–189.Google Scholar
  17. [17]
    M. Marsan, G. Blbo, G. Conte and F. Gregoretti, Modelling Bus Contention and Memory Interference in a Multiprocessor System, IEEE Transactions on Computers, vol. C-32, no. 1 (1983) pp. 60–72.CrossRefGoogle Scholar
  18. [18]
    H. Nassar, A Markov Model for Multibus Multiprocessor Systems under Asynchronous Operation, Information Processing Letters, vol. 54, no. 4 (1995) pp. 11–16.zbMATHCrossRefGoogle Scholar
  19. [19]
    H. Nassar and J. Carpinelli, Generalized Model for Banyan Networks with Nonuniform Traffic, IEE Proceedings on Computers and Digital Techniques, vol. 145, no. 3 (1998) pp. 225–228.CrossRefGoogle Scholar
  20. [20]
    H. Nassar and J. Carpinelli, Design and Performance of a Fault-Tolerant Clos Net- work, 26th Conference on Information Sciences & Systems, Maryland, USA, March 22–24 (1995).Google Scholar
  21. [21]
    H. Nassar and J. Carpinelli, A Simple Fault Tolerant Technique for Interconnection Networks, ISCA Intl Conference on Parallel and Distributed Computing 4 Systems, Kentucky, USA, October 14–16 (1993) pp. 25–30.Google Scholar
  22. [22]
    K. Padmanabhan and D. Lawrie, A Class of Redundant Paths Multistage Interconnection Networks, IEEE Transactions on Computers, vol. C-32, no. 12 (1983) pp. 1099–1108.CrossRefGoogle Scholar
  23. [23]
    J. Patel, Performance of Processor-Memory Interconnections for Multiprocessors, IEEE Transactions on Computers, vol. C-30, no. 10 (1981) pp. 771–780.CrossRefGoogle Scholar
  24. [24]
    C. Raghavendra and A. Varma, INDRA: A Class of Interconnection Networks with Redundant Paths, Proceedings of the 1984 Real Time Systems Symposium, pp. 153–164.Google Scholar
  25. [25]
    S. Reddy and V. Kumar, On Fault Tolerant Multistage Interconnection Networks, Proceedings of the 1984 International Conference on Parallel Processing, pp. 155–164.Google Scholar
  26. [26]
    J. P. Shen and J. P. Hayes, Fault-tolerant of Dynamic-full-access Interconnection Networks, IEEE Transactions on Computers, vol. C-33, no. 3 (1984) pp. 241–248.CrossRefGoogle Scholar
  27. [27]
    C. Wu and T. Feng, On a Class of Multistage Interconnection Networks, IEEE Transactions on Computers, vol. C-29, no. 8 (1980) pp. 694–702.MathSciNetGoogle Scholar
  28. [28]
    C. Wu and T. Feng, The Universality of the Shuffle-Exchange Network, IEEE Transactions on Computers, vol. C-30, no. 5, May 1981, pp. 324–332.MathSciNetCrossRefGoogle Scholar
  29. [29]
    K. Yoon and W. Hegazy, The Extra Stage Gamma. Network, Proceedings of the 13th Annual Symposium on Computer Architecture, 1986, pp. 175–182.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  1. 1.Department of Electrical and Computer EngineeringNew Jersey Institute of TechnologyNewarkUSA
  2. 2.Department of Engineering Sciences Faculty of Petroleum EngineeringSuez Canal UniversitySuezEgypt

Personalised recommendations