Skip to main content
SpringerLink
Log in

Analyzing the reliability of degradable networks

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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.

  2. M. T. Liu, Distributed loop computer networks.Advances in Computers, 1978, 17, 162–221.

    Google Scholar 

  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.

  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.

  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.

    Article  Google Scholar 

  6. D. G. Baker, Local-Area Networks with Fiber-Optic Applications. Prentice-Hall, Englewood Cliffs, NJ, 1986.

    Google Scholar 

  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.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  9. H. Robbins, A theorem on graphs with an application to a problem of traffic control.American Math. Monthly, 1939, 4G, 281–283.

    Article  MathSciNet  Google Scholar 

  10. F. Boesch and R. Tindell, Robbin's theorem for mixed multigraphs.American Math. Monthly, 1980, 87, 716–719.

    Article  MATH  MathSciNet  Google Scholar 

  11. W. Shi, Improving the reliability and invulnerability of communication networks. Ph. D. Thesis (Electrical Engineering) Worcester Polytechnic Institute, Worcester, MA, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Thinking Machines Corporation, 245 First Street, 02142-1264, Cambridge, MA, U. S. A.

    Shi Weigeng

  2. Department of Mathematical Sciences, Worcester-Polytechnic Institute, 01609, Worcester, MA, U. S. A.

    Brigitte Servatius

Authors
  1. Shi Weigeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Brigitte Servatius
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shi, W., Servatius, B. Analyzing the reliability of degradable networks. J. of Comput. Sci. & Technol. 8, 77–86 (1993). https://doi.org/10.1007/BF02946588

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02946588

Keywords

Search

Navigation