Bounding flow-performance in probabilistic weighted networks

Author

Strayer, Heidi J. ; Colbourn, Charles J.

Author_Institution

Dept. of Comput. Sci. & Eng., Univ. of South Florida, Tampa, FL, USA

Volume

46

Issue

1

fYear

1997

fDate

3/1/1997 12:00:00 AM

Firstpage

3

Lastpage

10

Abstract

Much research has been done on computing connectivity-probability in probabilistic networks. More recently, the area has been expanded to other performance measures, such as maxflow and distance. These problems are, in general, NP-hard. Therefore efficiently computable, and accurate, lower and upper bounds are sought. This paper presents: 1) distance renormalization which generalizes the reliability renormalization algorithm of Harms and Colbourn for bounding probabilistic distances in bi-directional probabilistic weighted networks; and 2) a mechanism based on nonplanar duality for using this algorithm to bound probabilistic maxflow and mean maxflow. The results obtained via distance renormalization compare favorably with other current techniques for the authors´ suite of test cases

Keywords

nonlinear programming; probability; reliability theory; telecommunication network reliability; CPU time; bounding flow-performance; communication network reliability; connectivity-probability; distance renormalization; mean maxflow; nonplanar duality; probabilistic distances bounding; probabilistic maxflow; probabilistic weighted networks; reliability renormalization algorithm; Area measurement; Bidirectional control; Computer networks; Failure analysis; Intelligent networks; Polynomials; Telecommunication network reliability; Testing; Throughput; Upper bound;

fLanguage

English

Journal_Title

Reliability, IEEE Transactions on

Publisher

ieee

ISSN

0018-9529

Type

jour

DOI

10.1109/24.589919

Filename

589919