Close category search window
 

Reliability Analysis of Networks with Capacity-Constraints and Failures at Branches & Nodes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Rueger, W.J. ; Academy of Sciences, Potsdam

A new method for reliability analysis of stochastic flow networks is proposed. Nodes as well as branches can have limited capacities and can fail. The method builds a branching tree. The tree-nodes are the disjoint terms of a symbolic reliability expression. The paper shows how to find the probability function and mean of the network performance. The method is both simple and effective. The minimal paths or cutsets are not needed explicitly. On a computer the memory effort is very low ¿ it increases only quadratically with the number of failing elements. The method can be modified reasonably for other reliability problems.

Published in:
Reliability, IEEE Transactions on  (Volume:35 ,  Issue: 5 )

Date of Publication: Dec. 1986

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.