Skip to main content
SpringerLink
Log in

Analysis of fault location in a network

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We review and analyze a formal problem of fault location in point‐to‐point telecommunicationnetworks which are modeled as undirected graphs. For a network with no bridgeedges, we present a technique for constructing a tour that is able to locate a single fault. Wealso develop theory that provides the necessary and sufficient conditions for locating anddetecting a single fault.

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. A. Bouloutas, G. Hart and M. Schwartz, On the design of observers for failure detection of discrete event systems, in: Network Management and Control, eds. A. Kershenbaum, M. Malek and M. Wall, Plenum Press, New York, 1990.

    Google Scholar 

  2. T. Cormen, C. Leiserson and R. Rivest, Introduction to Algorithms, McGraw-Hill, 1990.

  3. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.

    Google Scholar 

  4. C.J. Hoelting, D.A. Schoenefeld and R.L. Wainwright, Finding investigator tours in telecommunication networks using genetic algorithms, Proceedings of the 1996 ACM Symposium on Applied Computing, ACM Press, 1996, pp. 82-87.

  5. C.L. Liu, Elements of Discrete Mathematics, 2nd ed., McGraw-Hill, 1985.

  6. U. Manber, Introduction to Algorithms, Addison-Wesley, Reading, MA, 1989.

    Google Scholar 

  7. S. Paul and R. Miller, Locating faults in a systematic manner in a large heterogeneous network, Proceedings of INFOCOM 1995.

  8. I. Rouvellou and G. Hart, Topology identification for traffic and configuration management in dynamic networks, Proceedings of INFOCOM 1992, pp. 2197-2204.

  9. S. Skiena, Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, Addison-Wesley, Redwood City, CA, 1990.

    Google Scholar 

  10. C. Wang and M. Schwartz, Fault detection with multipleobservers, IEEE/ACM Transactions on Networking 1(1993)48-55.

    Google Scholar 

  11. C. Wang and M. Schwartz, Fault diagnosis of network connectivity problems by probabilistic reasoning, in: Proceedings of the 2nd IEEE Network Management and Control Workshop, Sept., 1993.

  12. S. Wolfram, Mathematica: A System for Doing Mathematics by Computer, Addison-Wesley, Redwood City, CA, 1991.

    Google Scholar 

Download references

Authors
  1. C.J. Hoelting
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D.A. Schoenefeld
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R.L. Wainwright
    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

Hoelting, C., Schoenefeld, D. & Wainwright, R. Analysis of fault location in a network. Annals of Operations Research 86, 161–177 (1999). https://doi.org/10.1023/A:1018946516733

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018946516733

Keywords

Search

Navigation