Journal of Computer Science and Technology

, Volume 8, Issue 1, pp 77–86 | Cite as

Analyzing the reliability of degradable networks

  • Shi Weigeng 
  • Brigitte Servatius
Regular Papers


The reachability of a strongly connected network may be destroyed after link damage. Since many networds have directed links with the potential for reversal, the reachability may be restored by reversing the direction of links. In this paper, the reliability of a network that allows reversal of links is discussed.


Network reliability degradable network network reconfiguration fault tolerant system fault tolerant network strongly connected network 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J. H. Saltzer and K. T. Pogran, A star-shaped ring network with high maintainability. Proc. Local Area Communication Network Symp., titre Corp., pp. 179–190, May 1979.Google Scholar
  2. [2]
    M. T. Liu, Distributed loop computer networks.Advances in Computers, 1978, 17, 162–221.Google Scholar
  3. [3]
    J. Wolf, M. T. Liu, B. Weide and D. Tsay, Design of a Distributed Fault-Tolerant Loop Networks. Proc. 9th Annu. Int. Symp. Fault-Tolerant Computing, Madison, WI, June 1979, 17–24.Google Scholar
  4. [4]
    A. Groarov, L. Kleinrock and M. Gerla, A Highly Reliable Distributed Loop Network Architecture. Proc. Int. Symp. Fault-Tolerant Computing, Kyoto, Japan, Oct. 1980, 319–324.Google Scholar
  5. [5]
    C. S. Raghavendra, M. Gerla and A. Avizienis, Reliable loop topologies for large local computer networks.IEEE Transactions on Computers, 1985, 34(1), 46–55.CrossRefGoogle Scholar
  6. [6]
    D. G. Baker, Local-Area Networks with Fiber-Optic Applications. Prentice-Hall, Englewood Cliffs, NJ, 1986.Google Scholar
  7. [7]
    J. W. Reedy, The TDM ring—a fiber optic transport system for campus or metropolitan networks.IEEE Journal On Selected Areas In Communications, 1985, SAC-4(9), 1474–1483.CrossRefGoogle Scholar
  8. [8]
    A. Brosio, F. Gagliardi, L. Lambarelli, G. Panarotto, D. Roffinella and M. Sposini, A Reconfigurable high-speed optical system for integrated local communications.IEEE Fournal On Selected Areas In Communications, 1985, SAC-3(6), 825–834.CrossRefGoogle Scholar
  9. [9]
    H. Robbins, A theorem on graphs with an application to a problem of traffic control.American Math. Monthly, 1939, 4G, 281–283.CrossRefMathSciNetGoogle Scholar
  10. [10]
    F. Boesch and R. Tindell, Robbin's theorem for mixed multigraphs.American Math. Monthly, 1980, 87, 716–719.MATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    W. Shi, Improving the reliability and invulnerability of communication networks. Ph. D. Thesis (Electrical Engineering) Worcester Polytechnic Institute, Worcester, MA, 1989.Google Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1993

Authors and Affiliations

  • Shi Weigeng 
    • 1
  • Brigitte Servatius
    • 2
  1. 1.Thinking Machines CorporationCambridgeU. S. A.
  2. 2.Department of Mathematical SciencesWorcester-Polytechnic InstituteWorcesterU. S. A.

Personalised recommendations