2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.
DOI: 10.1109/prdc.2002.1185623
|View full text |Cite
|
Sign up to set email alerts
|

Analyzing network reliability with imperfect nodes using OBDD

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 17 publications
0
6
0
Order By: Relevance
“…In this window, the designer can enter a file name or select an existing one. If the project has already been saved, the changes will be saved in the same file [11].…”
Section: Saving and Closing Projectsmentioning
confidence: 99%
“…In this window, the designer can enter a file name or select an existing one. If the project has already been saved, the changes will be saved in the same file [11].…”
Section: Saving and Closing Projectsmentioning
confidence: 99%
“…In the following, we focus on the graph-theoretic connectivity with heterogeneous wireless network coherence measures. Lee first defined and evaluated the heterogeneous wireless network reliability mainly based on heterogeneous wireless network connectivity [4]. Following the similar idea, a series of heterogeneous wireless network reliability evaluation algorithms and optimization methods have been proposed [3,[5][6][7][8][9][10][11][12].…”
Section: Introductionmentioning
confidence: 99%
“…With the deep study on the theory of cognitive radio, Motorola and Virginia Tech etc. proposed the concept of cognitive radio network (CRN) [4,5]. By the licensed spectrum resources "secondary use", CRNs can efficiently use licensed spectrum resources of lower utilization, which can effectively alleviate contradiction between the lack of spectrum resources and the growing demand for wireless access.…”
Section: Introductionmentioning
confidence: 99%
“…The difficulty of the problem has stimulated many approaches: partitioning techniques [12], sum of disjoint products [13], [14], [15], [16], [17], [18], graph simplifications (series-parallel reductions [1], delta-wye transformations [19], [20], [21], factoring [22]), determination of various lower and upper bounds to the reliability polynomial [2], [4], [23], [24], [25], Monte-Carlo simulations [26], [27], [28], and ordered binary decision diagram (OBDD) algorithms [29], [30], [31], [32]. Other decomposition methods have also been proposed [33], [34], [35].…”
Section: Introductionmentioning
confidence: 99%
“…The possibility of node failure has been considered in early papers [9], [40]. Adaptation of algorithms to include imperfect nodes has been addressed [32], [41], [42], [43], [44]. In order to be realistic, different edge reliabilities should be used too: for instance, the failure rate of optical fiber links is often assumed to increase with their length.…”
Section: Introductionmentioning
confidence: 99%