Computation in Network Reliability

Shin-Guang Chen ()
Additional contact information
Shin-Guang Chen: Tungnan University

A chapter in Reliability and Statistical Computing, 2020, pp 107-126 from Springer

Abstract: Abstract This chapter presents the primitive steps in computation of network reliability, and some of the popular examples by applying network reliability. Network reliability is one of the most interesting topics in network theory. It has been applied to many real-world applications such as traffic planning, computer network planning, power transmission planning, etc. The planners usually want to know how reliable the systems they planned. Network reliability helps them to get the answer of such questions. Due to its NP-hard nature, many approaches have been developed to tackle the efficiency problems in computations. One of the most promising methods is the three-stage approach, which divides the problem into three smaller problems and conquers them, making the resolution process more efficient than others. Several examples are presented in the chapter for illustrative purposes.

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:ssrchp:978-3-030-43412-0_7

Ordering information: This item can be ordered from
http://www.springer.com/9783030434120

DOI: 10.1007/978-3-030-43412-0_7

Access Statistics for this chapter

More chapters in Springer Series in Reliability Engineering from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().