Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Bounds for Network Reliability
- Issue Date
- Mar-2005
- Publisher
- 한국데이터정보과학회
- Keywords
- Associate; Minimal path and cut set arguments; Minmax principle; Network reliability; Associate; Minimal path and cut set arguments; Minmax principle; Network reliability
- Citation
- 한국데이터정보과학회지, v.16, no.1, pp 31 - 39
- Pages
- 9
- Journal Title
- 한국데이터정보과학회지
- Volume
- 16
- Number
- 1
- Start Page
- 31
- End Page
- 39
- ISSN
- 1598-9402
- Abstract
- A network consisting of a set ofnodes and a set of links is considered. The nodes are assumed to be perfect and the states of links to be binary and associated to each other. After defining a network structure function, which represents the state of network as a function of the states of links, we obtain some lower and upper bounds on the network reliability by adopting minmax principle and minimal path and cut set arguments. These bounds are given as functions of the reliabilities of links. The bridge network is considered as an example.
- Files in This Item
- Go to Link
- Appears in
Collections - 이과대학 > 통계학과 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.