Algorithms for minimising the lost flow due to failed components in repairable flow networks with complex topology

Michael T. Todinov

International Journal of Reliability and Safety, 2012, vol. 6, issue 4, 283-310

Abstract: A number of fundamental theorems related to non-reconfigurable repairable flow networks have been stated and proved. For a specified source-to-sink path, the difference between the sum of the unavailabilities of its forward edges and the sum of the unavailabilities of its backward edges is the path resistance. In a repairable flow network, the absence of augmentable cyclic paths with negative resistance is a necessary and sufficient condition for a minimum lost flow due to edge failures. For a specified source-to-sink path, the difference between the sum of the hazard rates of its forward empty edges and the sum of the hazard rates its backward empty edges is the flow disruption number of the path. The absence of augmentable cyclic paths with a negative flow disruption number is a necessary and sufficient condition for a minimum probability of undisturbed throughput flow, by edge failures.

Keywords: repairable flow networks; disturbed flows; complex topology; failed components; component failure; throughput flow. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=49597 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijrsaf:v:6:y:2012:i:4:p:283-310

Access Statistics for this article

More articles in International Journal of Reliability and Safety from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().