메뉴 건너뛰기




Volumn , Issue , 2007, Pages

Exact two-terminal reliability of some directed networks

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; STRUCTURAL DESIGN; SYSTEMS ENGINEERING; TELECOMMUNICATION NETWORKS; TRANSFER MATRIX METHOD;

EID: 63249093894     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DRCN.2007.4762273     Document Type: Conference Paper
Times cited : (11)

References (66)
  • 1
    • 85010248741 scopus 로고    scopus 로고
    • E. F. Moore and C. E. Shannon, Reliable circuits using less reliable relays, J. Franklin Institute, 262, pp. 191-208, September 1956; 262, pp. 281-297, October 1956.
    • E. F. Moore and C. E. Shannon, "Reliable circuits using less reliable relays, " J. Franklin Institute, vol. 262, pp. 191-208, September 1956; vol. 262, pp. 281-297, October 1956.
  • 2
    • 77957036347 scopus 로고    scopus 로고
    • M. O. Ball, C. J. Colbourn, and J. Scott Provan, Network reliability, Handbooks in operations research and management science, 7: Network Models, M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser (Editors), Amsterdam: Elsevier, 1995, pp. 673-762 (with over 400 references).
    • M. O. Ball, C. J. Colbourn, and J. Scott Provan, "Network reliability, " Handbooks in operations research and management science, volume 7: Network Models, M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser (Editors), Amsterdam: Elsevier, 1995, pp. 673-762 (with over 400 references).
  • 9
    • 0024933465 scopus 로고
    • Computing 2-terminal reliability for radio-broadcast networks
    • H. M. AboElFotoh and C. J. Colbourn, "Computing 2-terminal reliability for radio-broadcast networks, " IEEE Trans. Reliability, vol. 38 (5), pp. 538-555, 1989.
    • (1989) IEEE Trans. Reliability , vol.38 , Issue.5 , pp. 538-555
    • AboElFotoh, H.M.1    Colbourn, C.J.2
  • 10
    • 20844461192 scopus 로고    scopus 로고
    • You may rely on the reliability polynomial for much more than you might think
    • J. Graver and M. Sobel, "You may rely on the reliability polynomial for much more than you might think, " Communications in Statistics: Theory and Methods, vol. 34 (6), 1411-1422, 2005.
    • (2005) Communications in Statistics: Theory and Methods , vol.34 , Issue.6 , pp. 1411-1422
    • Graver, J.1    Sobel, M.2
  • 11
    • 0003238314 scopus 로고
    • Complexity: Knots, Colourings and Counting,
    • London Mathematical Society, Cambridge: Cambridge University Press
    • D. J. A. Welsh, "Complexity: Knots, Colourings and Counting, " London Mathematical Society, Lecture Note Series 186, Cambridge: Cambridge University Press, 1993.
    • (1993) Lecture Note Series , vol.186
    • Welsh, D.J.A.1
  • 12
    • 0018532893 scopus 로고
    • A new analysis technique for probabilistic graphs
    • W. P. Dotson and J. O. Gobien, "A new analysis technique for probabilistic graphs, " IEEE Trans. Circuits and Systems, vol. 26 (10), pp. 855-865, 1979.
    • (1979) IEEE Trans. Circuits and Systems , vol.26 , Issue.10 , pp. 855-865
    • Dotson, W.P.1    Gobien, J.O.2
  • 13
    • 0018455846 scopus 로고
    • An improved algorithm for network reliability
    • J. A. Abraham, "An improved algorithm for network reliability, " IEEE Trans. Reliability, vol. 28 (1), pp. 58-61, 1979.
    • (1979) IEEE Trans. Reliability , vol.28 , Issue.1 , pp. 58-61
    • Abraham, J.A.1
  • 14
    • 0347603324 scopus 로고    scopus 로고
    • Preprocessing minpaths for sum of disjoint products
    • A. O. Balan and L. Traldi, "Preprocessing minpaths for sum of disjoint products, " IEEE Trans. Reliability, vol. 52 (3), pp. 289-295, 2003.
    • (2003) IEEE Trans. Reliability , vol.52 , Issue.3 , pp. 289-295
    • Balan, A.O.1    Traldi, L.2
  • 15
    • 0024718773 scopus 로고
    • Smaller sums of disjoint products by subproduct inversion
    • K. D. Heidtmann, "Smaller sums of disjoint products by subproduct inversion, " IEEE Trans. Reliability, vol. 38, pp. 305-311, 1989.
    • (1989) IEEE Trans. Reliability , vol.38 , pp. 305-311
    • Heidtmann, K.D.1
  • 16
    • 85025253957 scopus 로고
    • A survey of efficient reliability computation using disjoint products approach
    • and references therein
    • S. Rai, M. Veeraraghavan, and K. S. Trivedi, "A survey of efficient reliability computation using disjoint products approach, " Networks, vol. 25, pp. 147-163, 1995, and references therein.
    • (1995) Networks , vol.25 , pp. 147-163
    • Rai, S.1    Veeraraghavan, M.2    Trivedi, K.S.3
  • 18
    • 0027558205 scopus 로고
    • Experimental results on preprocessing of path/cut terms in sum of disjoint products technique
    • S. Soh and S. Rai, "Experimental results on preprocessing of path/cut terms in sum of disjoint products technique, " IEEE Trans. Reliability, vol. 42 (1), pp. 24-33, 1993.
    • (1993) IEEE Trans. Reliability , vol.42 , Issue.1 , pp. 24-33
    • Soh, S.1    Rai, S.2
  • 19
    • 0019554601 scopus 로고
    • System effectiveness evaluation using star and delta transformations
    • J. P. Gadani, "System effectiveness evaluation using star and delta transformations, " IEEE Trans. Reliability, vol. 30 (1), pp. 43-47, 1981.
    • (1981) IEEE Trans. Reliability , vol.30 , Issue.1 , pp. 43-47
    • Gadani, J.P.1
  • 20
    • 0017502775 scopus 로고    scopus 로고
    • A. Rosenthal and D. Frisque, Transformations for simplifying network reliability calculations, Networks, 7, pp. 97-111, 1977; errata, Networks, 7, p. 382, 1977.
    • A. Rosenthal and D. Frisque, "Transformations for simplifying network reliability calculations, " Networks, vol. 7, pp. 97-111, 1977; errata, Networks, vol. 7, p. 382, 1977.
  • 21
    • 0030104186 scopus 로고    scopus 로고
    • Transformations of star-delta and delta-star reliability networks
    • S.-D. Wang and C.-H. Sun, "Transformations of star-delta and delta-star reliability networks, " IEEE Trans. Reliability, vol. 45 (1), pp. 120-126, 1996.
    • (1996) IEEE Trans. Reliability , vol.45 , Issue.1 , pp. 120-126
    • Wang, S.-D.1    Sun, C.-H.2
  • 22
    • 0022075717 scopus 로고
    • A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
    • R. Kevin Wood, "A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability, " Networks, vol. 15, pp. 173-190, 1985.
    • (1985) Networks , vol.15 , pp. 173-190
    • Kevin Wood, R.1
  • 23
    • 0024750734 scopus 로고
    • Bounds on the reliability of binary coherent systems
    • F. Beichelt and L. Spross, "Bounds on the reliability of binary coherent systems, " IEEE Trans. Reliability, vol. 38 (4), pp. 425-427, 1989.
    • (1989) IEEE Trans. Reliability , vol.38 , Issue.4 , pp. 425-427
    • Beichelt, F.1    Spross, L.2
  • 24
    • 0022946035 scopus 로고
    • Improving reliability bounds in computer networks
    • T. B. Brecht and C. J. Colbourn, "Improving reliability bounds in computer networks, " Networks, vol. 16, pp. 369-380, 1986.
    • (1986) Networks , vol.16 , pp. 369-380
    • Brecht, T.B.1    Colbourn, C.J.2
  • 25
    • 84924073176 scopus 로고
    • Bounds on the reliability of networks
    • J. Scott Provan, "Bounds on the reliability of networks, " IEEE Trans. Reliability, vol. 35 (3), pp. 260-268, 1986.
    • (1986) IEEE Trans. Reliability , vol.35 , Issue.3 , pp. 260-268
    • Scott Provan, J.1
  • 26
    • 0022736325 scopus 로고
    • A comparison of four Monte Carlo methods for estimating the probability of s-t connectedness
    • G. S. Fishman, "A comparison of four Monte Carlo methods for estimating the probability of s-t connectedness, " IEEE Trans. Reliability, vol. 35 (2), pp. 145-155, 1986.
    • (1986) IEEE Trans. Reliability , vol.35 , Issue.2 , pp. 145-155
    • Fishman, G.S.1
  • 27
    • 0035439423 scopus 로고    scopus 로고
    • A randomized fully polynomial time approximation scheme for the all terminal reliability problem
    • D. R. Karger, "A randomized fully polynomial time approximation scheme for the all terminal reliability problem, " SIAM Review, vol. 43 (3), pp. 499-522, 2001.
    • (2001) SIAM Review , vol.43 , Issue.3 , pp. 499-522
    • Karger, D.R.1
  • 28
    • 84986928064 scopus 로고
    • Combining Monte Carlo estimates and bounds for network reliability
    • L. D. Nel and C. J. Colbourn, "Combining Monte Carlo estimates and bounds for network reliability, " Networks, vol. 20, pp. 277-298, 1990.
    • (1990) Networks , vol.20 , pp. 277-298
    • Nel, L.D.1    Colbourn, C.J.2
  • 29
    • 0000483766 scopus 로고    scopus 로고
    • Determining terminal pair reliability based on edge expansion diagrams using OBDD
    • S. Kuo, S. Lu, and F. Yeh, "Determining terminal pair reliability based on edge expansion diagrams using OBDD, " IEEE Trans. Reliability, vol. 48 (3), pp. 234-246, 1999.
    • (1999) IEEE Trans. Reliability , vol.48 , Issue.3 , pp. 234-246
    • Kuo, S.1    Lu, S.2    Yeh, F.3
  • 30
    • 0037333175 scopus 로고    scopus 로고
    • A new methodology to handle Boolean models with loops
    • A. Rauzy, "A new methodology to handle Boolean models with loops, " IEEE Trans. Reliability, vol. 52, pp. 96-105, 2003.
    • (2003) IEEE Trans. Reliability , vol.52 , pp. 96-105
    • Rauzy, A.1
  • 31
    • 0036891352 scopus 로고    scopus 로고
    • OBDD-based evaluation of kterminal network reliability
    • F. M. Yeh, S. K. Lu, and S. Y. Kuo, "OBDD-based evaluation of kterminal network reliability, " IEEE Trans. Reliability, vol. 51, pp. 443-451, 2002.
    • (2002) IEEE Trans. Reliability , vol.51 , pp. 443-451
    • Yeh, F.M.1    Lu, S.K.2    Kuo, S.Y.3
  • 33
    • 0002667254 scopus 로고    scopus 로고
    • A Decomposition Algorithm for Network Reliability Evaluation
    • J. Carlier and C. Lucet, "A Decomposition Algorithm for Network Reliability Evaluation, " Discr. Appl. Math., vol. 65, pp. 141-156, 1996.
    • (1996) Discr. Appl. Math , vol.65 , pp. 141-156
    • Carlier, J.1    Lucet, C.2
  • 34
    • 38049076747 scopus 로고    scopus 로고
    • Discovering Treewidth,
    • UU-CS-2005-018, Utrecht University, 2005, and references therein
    • H. L. Bodlaender, "Discovering Treewidth, " technical report UU-CS-2005-018, Utrecht University, 2005, and references therein.
    • technical report
    • Bodlaender, H.L.1
  • 36
    • 63249120595 scopus 로고    scopus 로고
    • M. K. Chari and C. J. Colbourn, Reliability polynomials: a survey, J. Combin. Inform. System Sci., 22, pp. 177-193, 1997; August 12, 1998 Web version.
    • M. K. Chari and C. J. Colbourn, "Reliability polynomials: a survey, " J. Combin. Inform. System Sci., vol. 22, pp. 177-193, 1997; August 12, 1998 Web version.
  • 37
    • 0141945518 scopus 로고
    • Some open problems on reliability polynomials,
    • 93-28, April 1993; Congressus Numerantium
    • C. J. Colbourn, "Some open problems on reliability polynomials, " DIMACS technical report 93-28, April 1993; Congressus Numerantium, vol. 93, pp. 187-202, 1993.
    • (1993) DIMACS technical report , vol.93 , pp. 187-202
    • Colbourn, C.J.1
  • 38
    • 0035993125 scopus 로고    scopus 로고
    • Chromatic, flow and reliability polynomials: The complexity of their coefficients
    • J. Oxley and D. Welsh, "Chromatic, flow and reliability polynomials: the complexity of their coefficients, " Combinatorics, Probability and Computing, vol. 11, pp. 403-426, 2002.
    • (2002) Combinatorics, Probability and Computing , vol.11 , pp. 403-426
    • Oxley, J.1    Welsh, D.2
  • 39
    • 0042277086 scopus 로고
    • Roots of the reliability polynomial
    • J. I. Brown and C. J. Colbourn, "Roots of the reliability polynomial, " SIAM J. Disc. Math., vol. 5 (4), pp. 571-585, 1992.
    • (1992) SIAM J. Disc. Math , vol.5 , Issue.4 , pp. 571-585
    • Brown, J.I.1    Colbourn, C.J.2
  • 40
    • 0015994389 scopus 로고
    • Exact Calculation of Computer Network Reliability
    • E. Hänsler, G. K. McAuliffe, and R. S. Wilkov, "Exact Calculation of Computer Network Reliability, " Networks, vol. 4, pp. 95-112, 1974.
    • (1974) Networks , vol.4 , pp. 95-112
    • Hänsler, E.1    McAuliffe, G.K.2    Wilkov, R.S.3
  • 41
    • 0031223605 scopus 로고    scopus 로고
    • Reliability evaluation for distributed computing networks with imperfect nodes
    • W.-J. Ke and S.-D. Wang, "Reliability evaluation for distributed computing networks with imperfect nodes, " IEEE Trans. Reliability, vol. 46 (3), pp. 342-349, 1997.
    • (1997) IEEE Trans. Reliability , vol.46 , Issue.3 , pp. 342-349
    • Ke, W.-J.1    Wang, S.-D.2
  • 42
    • 0030109534 scopus 로고    scopus 로고
    • Consideration of node failures in networkreliability calculation
    • V. A. Netes and B. P. Filin, "Consideration of node failures in networkreliability calculation, " IEEE Trans. Reliability, vol. 45 (1), pp. 127-128, 1996.
    • (1996) IEEE Trans. Reliability , vol.45 , Issue.1 , pp. 127-128
    • Netes, V.A.1    Filin, B.P.2
  • 43
    • 0026172999 scopus 로고
    • Factoring & reductions for networks with imperfect vertices
    • O. R. Theologou and J. G. Carlier, "Factoring & reductions for networks with imperfect vertices, " IEEE Trans. Reliability, vol. 40 (2), pp. 210-217, 1991.
    • (1991) IEEE Trans. Reliability , vol.40 , Issue.2 , pp. 210-217
    • Theologou, O.R.1    Carlier, J.G.2
  • 44
    • 0028510944 scopus 로고
    • Calculation of node-pair reliability in large networks with unreliable nodes
    • and
    • D. Torrieri, "Calculation of node-pair reliability in large networks with unreliable nodes, " IEEE Trans. Reliability, vol. 43 (3), pp. 375-377 and 382, 1994.
    • (1994) IEEE Trans. Reliability , vol.43 , Issue.3
    • Torrieri, D.1
  • 48
    • 0004242420 scopus 로고
    • 2nd edition, Cambridge: Cambridge University Press
    • N. Biggs, Algebraic graph theory, 2nd edition, Cambridge: Cambridge University Press, 1993.
    • (1993) Algebraic graph theory
    • Biggs, N.1
  • 49
    • 0003652674 scopus 로고    scopus 로고
    • Cambridge: Cambridge University Press, chapter 4
    • R. P. Stanley, Enumerative combinatorics, vol. 1, Cambridge: Cambridge University Press, 1997, chapter 4.
    • (1997) Enumerative combinatorics , vol.1
    • Stanley, R.P.1
  • 50
    • 0016117852 scopus 로고
    • A new method to determine the failure frequency of a complex system
    • October
    • C. Singh and R. Billinton, "A new method to determine the failure frequency of a complex system, " IEEE Trans. Reliability, vol. R-23, pp. 231-234, October 1974.
    • (1974) IEEE Trans. Reliability , vol.R-23 , pp. 231-234
    • Singh, C.1    Billinton, R.2
  • 51
    • 0016521011 scopus 로고
    • Tie set approach to determine the frequency of system failure
    • C. Singh, "Tie set approach to determine the frequency of system failure, " Microelectron. & Reliab., vol. 14, pp. 293-294, 1975.
    • (1975) Microelectron. & Reliab , vol.14 , pp. 293-294
    • Singh, C.1
  • 52
    • 0019624729 scopus 로고
    • Computing failure frequency, MTBF & MTTR via mixed products of availabilities and unavailabilities
    • October
    • W. G. Schneeweiss, "Computing failure frequency, MTBF & MTTR via mixed products of availabilities and unavailabilities, " IEEE Trans. Reliability, vol. R-30, pp. 362-363, October 1981.
    • (1981) IEEE Trans. Reliability , vol.R-30 , pp. 362-363
    • Schneeweiss, W.G.1
  • 53
    • 0019654314 scopus 로고
    • General formulas for calculating the steady-state frequency of system failure
    • December
    • D.-H. Shi, "General formulas for calculating the steady-state frequency of system failure, " IEEE Trans. Reliability, vol. R-30, pp. 444-447, December 1981.
    • (1981) IEEE Trans. Reliability , vol.R-30 , pp. 444-447
    • Shi, D.-H.1
  • 54
    • 0034156367 scopus 로고    scopus 로고
    • Generic rules to evaluate system-failure frequency
    • March
    • S. V. Amari, "Generic rules to evaluate system-failure frequency, " IEEE Trans. Reliability, vol. 49, pp. 85-87, March 2000.
    • (2000) IEEE Trans. Reliability , vol.49 , pp. 85-87
    • Amari, S.V.1
  • 55
    • 0742321097 scopus 로고    scopus 로고
    • Computing System Failure Frequencies and Reliability Importance Measures Using OBDD
    • January
    • Y.-R. Chang, S. V. Amari, and S.-Y. Kuo, "Computing System Failure Frequencies and Reliability Importance Measures Using OBDD, " IEEE Trans. Computers, vol. 53, pp. 54-68, January 2004.
    • (2004) IEEE Trans. Computers , vol.53 , pp. 54-68
    • Chang, Y.-R.1    Amari, S.V.2    Kuo, S.-Y.3
  • 56
    • 0041307946 scopus 로고
    • Addendum to: Computing failure frequency via mixed products of availabilities and unavailabilities
    • December
    • W. G. Schneeweiss, "Addendum to: Computing failure frequency via mixed products of availabilities and unavailabilities, " IEEE Trans. Reliability, vol. R-32, pp. 461-462, December 1983.
    • (1983) IEEE Trans. Reliability , vol.R-32 , pp. 461-462
    • Schneeweiss, W.G.1
  • 60
    • 0035343957 scopus 로고    scopus 로고
    • Matrix method for chromatic polynomials
    • N. L. Biggs, "Matrix method for chromatic polynomials, " J. Combin. Theory B, vol. 82, pp. 19-29, 2001.
    • (2001) J. Combin. Theory B , vol.82 , pp. 19-29
    • Biggs, N.L.1
  • 61
    • 0035430046 scopus 로고    scopus 로고
    • Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I. General theory and square-lattice chromatic polynomial
    • cond-mat/0004330
    • J. Salas and A. D. Sokal, "Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I. General theory and square-lattice chromatic polynomial, " J. Statist. Phys., vol. 104, pp. 609-699, 2001; cond-mat/0004330.
    • (2001) J. Statist. Phys , vol.104 , pp. 609-699
    • Salas, J.1    Sokal, A.D.2
  • 62
    • 3242672717 scopus 로고    scopus 로고
    • G. F. Royle and A. D. Sokal, The Brown-Colbourn conjecture on zeros of reliability polynomials is false, J. Combin. Theory B, 91 (2), pp. 345-360, 2004; arXiv:math.CO/0301199.
    • G. F. Royle and A. D. Sokal, "The Brown-Colbourn conjecture on zeros of reliability polynomials is false, " J. Combin. Theory B, vol. 91 (2), pp. 345-360, 2004; arXiv:math.CO/0301199.
  • 63
    • 85204035069 scopus 로고    scopus 로고
    • S.-C. Chang and R. Shrock, Reliability polynomials and their asymptotic limits for families of graphs, J. Statist. Phys., 112, pp. 1019-1077, 2003; arXiv:cond-mat/0208538.
    • S.-C. Chang and R. Shrock, "Reliability polynomials and their asymptotic limits for families of graphs, " J. Statist. Phys., vol. 112, pp. 1019-1077, 2003; arXiv:cond-mat/0208538.
  • 65
    • 29844450023 scopus 로고    scopus 로고
    • The multivariate Tutte polynomial (alias Potts model) for graphs and matroids,
    • S. Webb Editor, Cambridge University Press, Cambridge, arXiv:math.CO/0503607
    • A. D. Sokal, "The multivariate Tutte polynomial (alias Potts model) for graphs and matroids, " Surveys in Combinatorics 2005, London Mathematical Society Lecture Note Series 327, Bridget S. Webb (Editor), Cambridge University Press, Cambridge, 2005, pp. 173-226; arXiv:math.CO/0503607.
    • (2005) Surveys in Combinatorics 2005, London Mathematical Society Lecture Note Series 327, Bridget , pp. 173-226
    • Sokal, A.D.1
  • 66
    • 4544229131 scopus 로고    scopus 로고
    • System optimization with component reliability estimation uncertainty: A multi-criteria approach
    • D. W. Coit, T. Jin, and N. Wattanapongsakorn, "System optimization with component reliability estimation uncertainty: a multi-criteria approach, " IEEE Trans. Reliability, vol. 53 (3), pp. 369-380, 2004.
    • (2004) IEEE Trans. Reliability , vol.53 , Issue.3 , pp. 369-380
    • Coit, D.W.1    Jin, T.2    Wattanapongsakorn, N.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.