• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.473-476
• /
• 2000

The network reliability is to be computed in terms of the terminal reliability. The computation of a termini reliability is started with a Boolean sum of products expression corresponding to simple paths of the pair of nodes. This expression is then transformed into another equivalent expression to be a Disjoint Sum of Products form. But this computaion of the terminal reliability obviously does not consider the communication between any other nodes but for the source and the sink. In this paper, we derive the overall network reliability which is the probability of communication that each node in the network communicates with all other remaining nodes. For this, we propose a method to make the SOP disjoint for deriving the network reliability expression from the system success expression using the modified Sheinman's method and modified BDD method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.1
• /
• pp.88-96
• /
• 1989

General measure in the reliability is the k-terminal reliability, which is the probability that the specified vertices are connected by the working edges. To compute the k-terminal reliability components are usually assumed to be statistically independent. In this study the modeling and analysis of the k-terminal reliability are investigated when dependency among components is considered. As the size of the network increases, the number of the joint probability parameter to represent the dependency among components is increasing exponentially. To avoid such a difficulty the structured-event-based-reliability model (SERM) is presented. This model uses the combination of the network topology (physical representation) and reliability block diagram (logical representation). This enables us to represent the dependency among components in a network form. Computational algorithms for the k-terminal reliability in SERM are based on the factoring algorithm Two features of the ractoring algorithm are the reliability preserving reduction and the privoting edge selection strategy. The pivoting edge selction strategy is modified by two different ways to tackle the replicated edges occuring in SERM. Two algorithms are presented according to each modified pivoting strategy and illustrated by numerical example.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.13 no.6
• /
• pp.20-23
• /
• 1976

A boolean algebra method for computing the reliability in a communication network is prosented. Given the set of all simple paths between two nodes in a network, the terminal reliability can be symbolically computed by the Boolean operation which is named parallel operation. The method seems to be promising for both oriented and nonoriented network.

• Journal of Korea Water Resources Association
• /
• v.36 no.1
• /
• pp.105-115
• /
• 2003

The computation model which evaluates combined hydraulic and mechanical reliability, is developed to analyze the integrated reliability in water distribution system. The hydraulic reliability is calculated by considering uncertain variables like water demand, hydraulic pressure, pipe roughness as random variables according to proper distribution type. The mechanical reliability is evaluated by analyzing the effect of pipe network with sequential failure of network components. The result of this study model applied to the real pipe network shows that this model can be used to simulate the uncertain factors effectively in real pipe network. Therefore, The pipe-line engineers can design and manage the network system with more quantitative reliability, through applying this model to reliable pipe network design and diagnosis of existing systems.

• Journal of Applied Reliability
• /
• v.14 no.2
• /
• pp.103-107
• /
• 2014

An algorithm to get network reliability, where each link has probability of fuzzy number, is proposed. Decomposition method and fuzzy numbers arithmetic are applied to the algorithm. Pivot link is chosen one by one from start node recursively at time of decomposition, and arithmetic of fuzzy complementary numbers is included at the same time. No criteria of pivot link selection and the recursive calculation make the algorithm simple.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.8
• /
• pp.1-10
• /
• 1995

We have analyzed the reliability of failure models in circuit-switched networks. These models are grid topology circuit-switched networks, and each node transmits a packet to a destination node using a Flooding routing method. We have assumed that the failure of each link and node is independent. We have considered two method to analyze reliability in these models : The Karnaugh Map method and joint probability method. In this two method, we have analyzed the reliability in a small grid topology circuit switched network by a joint probability method, and comared analytic results with simulated ones. For a large grid enormous. So, we have evaluated the reliability of the network by computer simulation techniques. As results, we have found that the analytic results are very close to simulated ones in a small grid topology circuit switched network. And, we have found that network reliability decreases exponentially, according to increment of link or node failure, and network reliability is almost linearly decreased according to increment of the number of links, by which call has passed. Finally, we have found an interesting result that nodes in a center of the network are superior to the other nodes from the reliability point of view.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.3071-3095
• /
• 2013

Configuring optimization of wireless sensor networks, which can improve the network performance such as utilization efficiency and network lifetime with minimal energy, has received considerable attention in recent years. In this paper, a cross layer optimal approach is proposed for multi-source linear network and grid network under Rayleigh block-fading channels, which not only achieves an optimal utility but also guarantees the end-to-end reliability. Specifically, in this paper, we first strictly present the optimization method for optimal nodal number $N^*$, nodal placement $d^*$ and nodal transmission structure $p^*$ under constraints of minimum total energy consumption and minimum unit data transmitting energy consumption. Then, based on the facts that nodal energy consumption is higher for those nodes near the sink and those nodes far from the sink may have remaining energy, a cross layer optimal design is proposed to achieve balanced network energy consumption. The design adopts lower reliability requirement and shorter transmission distance for nodes near the sink, and adopts higher reliability requirement and farther transmission distance for nodes far from the sink, the solvability conditions is given as well. In the end, both the theoretical analysis and experimental results for performance evaluation show that the optimal design indeed can improve the network lifetime by 20-50%, network utility by 20% and guarantee desire level of reliability.

• Journal of the Korean Geographical Society
• /
• v.44 no.2
• /
• pp.187-205
• /
• 2009

Failures on network components of a public transportation system can give rise to the severe degradation of entire system functionality. This paper aims at exploring how potential failures can affect the system flows and reliability of subway network systems in Metropolitan Seoul. To evaluate the range of impacts of disruptions, this research employs a probabilistic approach, network reliability. Network reliability measures the network resiliency and probability of flow loss under a variety of simulated disruptions of critical network components, transfer stations in subway system. By identifying the best and worst scenarios associated with geographical impact, as well as evaluating the criticality of transfer stations, this research presents some insights for protecting current subways systems.

• International Journal of Reliability and Applications
• /
• v.5 no.2
• /
• pp.81-103
• /
• 2004

Improvements of a bridge network system are studied in this paper. Then equivalence between different improved designs of the bridge network system is discussed. Three different methods are used to get different better designs of the network in the sense of having higher reliability and mean time to failure. Then two different types of reliability equivalence factors of the system are derived. It is assumed here that the failure rates of the system's components are identical and constant. The reliability functions and mean time to failure of the original and improved designs of the network are derived. Comparison between the mean time to failures of the original system and improved designs of the system are presented. Numerical studies and conclusion are presented in order to explain how one can apply the the theoretical results obtained.

• Journal of Korean Society for Quality Management
• /
• v.30 no.1
• /
• pp.162-171
• /
• 2002

A practical algorithm of generating most probable states in decreasing order of probability, given the probability of each unit\`s state, is suggested for approximating reliability(performability) evaluation of a network with multistate(multimode) units. Method of approximating network reliability for a given measure with most probable states is illustrated with a numerical example. The proposed method in this paper is compared with the previous method regarding memory requirement. Our method has some advantages for computation and achieves improvement with regard to memory requirement for a certain condition judging from the computation experiment.