Advertisement

Bounding Two-Terminal Network Reliability via Surface Duality

  • Heidi J. Strayer
Part of the Mathematics and Its Applications book series (MAIA, volume 329)

Abstract

Given a two-terminal (possibly directed) network with assigned edge probabilities, we establish that upper bounds on the reliability of any surface dual can be used to obtain lower bounds on the reliability of the primal. This observation leads to valuable new techniques for obtaining efficiently computable lower bounds on two-terminal reliability.

Keywords

Planar Graph Network Reliability Edge Probability Dual Edge Terminal Pair 
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]
    H.M. AboElFotoh, C.J. Colbourn, “Series-Parallel Bounds for the Two- Terminal Reliability Problem”, ORSA J. Comp (1988), 209–222.Google Scholar
  2. [2]
    T.B. Brecht, C.J. Colbourn, “Lower Bounds on Two-Terminal Network Reliability”, Discrete Appl Math 21 (1988), 185–198.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [3]
    C.J. Colbourn, The Combinatorics of Network Reliability, Oxford University Press, Oxford, 1987.Google Scholar
  4. [4]
    C.J. Colbourn, “Edge-Packings of Graphs and Network Reliability”, Discrete Math. 72 (1988), 49–61.MathSciNetzbMATHCrossRefGoogle Scholar
  5. [5]
    C.J. Colbourn, L.D. Nel, T.B. Boffey, D.F. Yates, “Network Reliability and the Probabilistic Estimation of Damage from Fire Spread”, Annals Oper. Res. 50 (1994) 173–185. itted for publication (1991).zbMATHCrossRefGoogle Scholar
  6. [6]
    J.L. Gross, T.W. Tucker, Topological Graph Theory, John Wiley and Sons, New York, 1987.zbMATHGoogle Scholar
  7. [7]
    D.D. Harms, C.J. Colbourn, “Renormalization of Two-Terminal Reliability”, Networks 23 (1993) 289–298.MathSciNetzbMATHCrossRefGoogle Scholar
  8. [8]
    D.D. Harms, A Symbolic Algebra Environment for Research in Network Reliability Ph.D. Thesis, Simon Eraser University (1992).Google Scholar
  9. [9]
    V.A. Kaustov, Y.I. Litvak, LA. Ushakov, “The Computational Effectiveness of Reliability Estimates by the Method of Nonedge-Intersecting Chains and Cuts”, Soviet J. Comput Systems Sci. 24 (1986), 70–73.MathSciNetGoogle Scholar
  10. [10]
    L.D. Nel, C.J. Colbourn, “Locating a Broadcast Facility in an Unreliable Network”, INFOR 28 (1990), 363–379.zbMATHGoogle Scholar
  11. [11]
    L.D. Nel, H.J. Strayer, “Two-Terminal Reliability Bounds based on Edge Packing by Cutsets”, J. Comb. Math. Comb. Comp. 13 (1993), 3–22.MathSciNetzbMATHGoogle Scholar
  12. [12]
    J.S. Provan, “The Complexity of Reliability Computations in Planar and Acyclic Graphs”, SIAM J. Computing 15 (1986), 694–702.MathSciNetzbMATHCrossRefGoogle Scholar
  13. [13]
    B Richter, H. Shank, “The Cycle Space of an Embedded Graph”, J. Graph Theory 8 (1984), 365–369.MathSciNetzbMATHCrossRefGoogle Scholar
  14. [14]
    J.G. Shanthikumar, “Reliability of Systems with Consecutive Minimal Cutsets”, IEEE Trans, on Reliab. 36 (1987), 546–550.zbMATHCrossRefGoogle Scholar
  15. [15]
    J.G. Shanthikumar, “Bounding Network Reliability Using Consecutive Minimal Cutsets”, IEEE Trans, on Reliab. 57 (1988), 45–49.CrossRefGoogle Scholar
  16. [16]
    A.W. Shogan, “Sequential Bounding of the Reliability of a Stochastic Network”, Operations Research 34 (1976), 1027–1044.MathSciNetCrossRefGoogle Scholar
  17. [17]
    S. Stahl, “Generalized Embedding Schemes”, Journal of Graph Theory 2 (1978), 41–52.MathSciNetzbMATHCrossRefGoogle Scholar
  18. [18]
    H. Strayer, C. Colbourn, “Bounding Network Reliability via Surface Duality”, preprint.Google Scholar

Copyright information

© Kluwer Academic Publishers. Printed in the Netherlands 1995

Authors and Affiliations

  • Heidi J. Strayer
    • 1
  1. 1.Department of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations