Efficient terminal-pair reliability algorithm for network management

Yu G. Chen*, Maria C. Yuang

*Corresponding author for this work

Research output: Contribution to journalConference article

Abstract

Terminal-pair reliability in network management determines the probabilistic reliability between the two nodes of a network, given failure probabilities of all links. The problem has been successfully solved by the path-based partition method, network reduction technique, and the combination of the two. The path-based partition algorithm, however, requires the repeated execution of a path-search procedure in an attempt to locally minimize the total number of subproblems generated. This paper proposes a cut-based partition algorithm based on the minimum cut separating the source from the remaining network nodes. This cut-based algorithm makes no attempt to locally minimize the number of subproblems, but greatly reduces the computation time for the partitioning of each subproblem. Experimental results show the superiority of the cut-based algorithm over the path-based algorithm especially for complex networks. By further employing the network reduction technique, this cut-based partition algorithm outperforms the path-based partition algorithm for all benchmarks and random sparse or dense networks.

Original languageEnglish
Pages (from-to)53-61
Number of pages9
JournalConference on Local Computer Networks
DOIs
StatePublished - 1 Dec 1995
EventProceedings of the 20th Conference on Local Computer Networks - Minneapolis, MN, USA
Duration: 16 Oct 199519 Oct 1995

Fingerprint Dive into the research topics of 'Efficient terminal-pair reliability algorithm for network management'. Together they form a unique fingerprint.

  • Cite this