• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• 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.

• 한국경영과학회지
• /
• 제14권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.

• 대한전자공학회논문지
• /
• 제13권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.

• 한국수자원학회논문집
• /
• 제36권1호
• /
• pp.105-115
• /
• 2003

본 연구에서는 상수관망의 신뢰도해석을 위해 수리적 신뢰도와 기계적 신뢰도를 통합적으로 해석할 수 있는 통합신뢰도 해석모형을 개발하였다. 수리적 신뢰도는 불화실성을 가진 변수들에 대하여 적절한 변동계수를 가진 확률 분포형을 적용시켜 임의변수로 고려하였고 기계적 신뢰도는 관망의 각 구성물에 대해 순차적 고장을 발생시켜 각 고장에 대한 영항을 해석하여 신뢰도를 산정하였다. 덕 연구모형을 실제관망에 대한 적용결과 본 모형은 실제관망에 대한 불확실한 요소를 고려한 신뢰도를 잘 모의하고 있었다. 앞으로 신뢰성있는 상수관망 설계 및 기존 관망의 신뢰도 판정에 본 모형이 적용된다면 기계적 및 수리적으로 객관성이 있는 신뢰도를 가진 상수관망의 건설 및 유지관리가 될 수 있다고 판단된다.

• 한국신뢰성학회지:신뢰성응용연구
• /
• 제14권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.

• 전자공학회논문지A
• /
• 제32A권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)
• /
• 제7권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.

• 대한지리학회지
• /
• 제44권2호
• /
• pp.187-205
• /
• 2009

최근 지리학 및 교통 관련 분야에서는 교통 네크워크의 잠재적 손실이 지리 공간상에서 어떠한 영향을 주는가를 살피는 연구가 중요한 주제로 등장하고 있다. 서울의 지하철망은 대규모의 도심 통행을 지지히는 중요한 기반시설이며, 특히 환승역은 그 기능을 상실할 경우 전체 교통망의 신뢰도에 큰 영향을 줄 수 있는 중요한 교통 입지시설이다. 이 논문은 지하철 환승역의 기능 손실이 지하철망의 신뢰도과 대응력에 어떠한 영향을 주는지를 네트워크의 위상학적인 차원, 전체 지리 공간, 그리고 개별 환승역 차원에서 살펴본다. 시뮬레이션을 통한 분석 결과, 서울 지하철망은 상당히 높은수준의 네트워크 신뢰도를 보였으나 환승역 간에는지리적으로 유의미한 변이가 있음을 확인하였다.

• International Journal of Reliability and Applications
• /
• 제5권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.

• 품질경영학회지
• /
• 제30권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.