A BDD-BASED ALGORITHM FOR COMPUTING THE K-TERMINAL NETWORK RELIABILITY

G. Hardy, C. Lucet and N. Limnios
Additional contact information
G. Hardy: LaRIA, Amiens, France
C. Lucet: LaRIA, Amiens, France
N. Limnios: LMAC, UTC, Compiegne, France

Chapter 3 in Recent Advances in Stochastic Operations Research, 2007, pp 39-49 from World Scientific Publishing Co. Pte. Ltd.

Abstract: AbstractThis paper presents an exact method using Binary Decision Diagram for computing the K-terminal reliability of networks such as computer, communication or power networks. The K-terminal reliability is defined as the probability that a subset K of nodes in the network can communicate together, taking into account the random failures of network components. Some examples and experiments show the effectiveness of this approach.

Keywords: Operations Research; Uncertainty; Applied Probability; Stochastic Process; Optimization; Decision Science (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.worldscientific.com/doi/pdf/10.1142/9789812706683_0003 (application/pdf)
https://www.worldscientific.com/doi/abs/10.1142/9789812706683_0003 (text/html)
Ebook Access is available upon purchase.

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:wsi:wschap:9789812706683_0003

Ordering information: This item can be ordered from

Access Statistics for this chapter

More chapters in World Scientific Book Chapters from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().