• 대한기계학회논문집A
• /
• 제35권6호
• /
• pp.629-633
• /
• 2011

항공기, 철도, 선박과 같은 대형 시스템들은 전기, 기계적으로 매우 복잡한 구조를 가졌으며 부품의 수명만을 고려한 기존의 유지보수에서 탈피하여, 고장분석의 시스템화를 통해 장치의 고유수명과는 관계없이 발생 가능한 우발고장도 대처할 수 있는 신뢰성 기반의 유지보수체계를 연구하여야 한다. 본 연구에서는 선행연구로 필요한 복합 시스템의 신뢰도 계산방법에 관한 연구이다. 복합 시스템의 신뢰도를 효과적으로 계산하기 위해 시스템의 RBD(Reliability Block Diagram)를 구성하고 인접행렬을 사용하여 RBD(Reliability Block Diagram)를 행렬로 표현한다. 또한 RBD(Reliability Block Diagram)행렬을 통하여 신뢰도 경로행렬과 고장열거 행렬을 구성하여 시스템의 신뢰도를 계산한다. 본 연구에서 제안한 알고리즘은 자동화, 시스템화가 가능하며 현재 개발하고 있는 신뢰도 정보관리 시스템 및 신뢰성 기반 유지보수 시스템에서 활용될 것이다.

• 한국가스학회지
• /
• 제17권1호
• /
• pp.49-55
• /
• 2013

최근 발전, 가스 설비, 화학공장 등의 대형 시스템들은 매우 복잡한 구조를 지니고 있다. 대부분의 공정들은 효율성을 위하여 높은 신뢰성을 요구하고 있으나, 복잡한 과정으로 인하여 신뢰도 분석이 상대적으로 어려운 실정이다. 복잡한 화학공정에서의 신뢰성 분석을 위하여 이 논문에서는 k-out-of-n로 구성된 화학공정을 RBD를 이용하여 신뢰성 경로를 파악하고, 고장판정행렬을 적용하여 신뢰도를 계산하였다. 이 기법이 k-out-of-n 시스템의 신뢰성 분석에 유용하게 사용될 수 있다는 것을 제시하였다.

• 한국시뮬레이션학회논문지
• /
• 제10권2호
• /
• pp.61-74
• /
• 2001

The reliability evaluation of the large scale network becomes very complicate according to the growing size of network. Moreover if the reliability is not constant but follows probability distribution function, it is almost impossible to compute them in theory. This paper studies the network evaluation methods in order to overcome such difficulties. For this an efficient path set algorithm which seeks the path set connecting the start and terminal nodes efficiently is developed. Also, various variance reduction techniques are applied to compute the system reliability to enhance the simulation performance. As a numerical example, a large scale network is given. The comparisons of the path set algorithm and the variance reduction techniques are discussed.

• 한국컴퓨터정보학회논문지
• /
• 제21권5호
• /
• pp.73-77
• /
• 2016

This paper deals with the network reliability problem that decides the communication line between main two districts while the k districts were destroyed in military communication network that the n communication lines are connected in m districts. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with O(n) linear time complexity to solve the optimal solution for this problem. This paper suggests the flow path algorithm (FPA) and level path algorithm (LPA). The FPA is to search the maximum number of distinct paths between two districts. The LPA is to construct the levels and delete the unnecessary nodes and edges. The proposed algorithm can be get the same optimal solution as LP for experimental data.

• Journal of the Korean Statistical Society
• /
• 제29권3호
• /
• pp.297-306
• /
• 2000

An efficient method of constructing $textsc{k}$-minimal path sets to evaluate the reliability of a flow network is presented. The network is considered to be in a functioning state if it can transmit a maximum flow which is greater than or equal to a specified amount of flow, $textsc{k}$say, and a $textsc{k}$-minimal path set is a minimal set of branches that satisfies the given flow constraint. In this paper, under the assumption that minimal path sets of the network are known, we generate composite paths by adding only a minimal set of branches at each iteration to get $textsc{k}$-minimal path sets after possibly the fewest composition, and compute maximum flow of composite paths using only minimal path sets. Thereby we greatly reduce the possible occurrence of redundant composite paths throughout the process and efficiently compute the maximum flow of composite paths generated. Numerical examples illustrate the method.

• 품질경영학회지
• /
• 제28권1호
• /
• pp.105-118
• /
• 2000

In this paper, we consider an interconnection network, DRDT (Dual Receive Dual Transmit), that is a double-loop ring topology and adopts the concept of multiple packets transmission. For three types of DRDT configurations, we investigate some properties related to path sets and discuss the method for finding minimal path sets. Using the concept of the terminal reliability and the path sets approach, we evaluate the reliability of the DRDT networks and compare them with a single ring network and a unidirectional double-loop ring network.

• Journal of Computing Science and Engineering
• /
• 제5권1호
• /
• pp.19-31
• /
• 2011

In this paper, we propose two new routing schemes for double-layered peer-to-peer systems; a shorter-lower mobility routing scheme and a reverse path routing scheme. The shorter-lower mobility routing scheme first chooses shortest routing paths among possible routing paths and selects the path associated with the relay peer who has lower mobility to improve the reliability of the system. The reverse path routing scheme carries out unicasting (instead of multicasting) based on the reverse path information that can be obtained during the initial file search to further reduce network traffic. The experimental results showed that a double-layered peer-topeer system with the proposed hybrid scheme improved the reliability of the system about 1.5% over the hop count scheme and reduced network traffic by about 0.5% compared to the hop count scheme.

• 한국안전학회지
• /
• 제11권1호
• /
• pp.16-26
• /
• 1996

A.Satyanarayana와 다른이들은 [1.2.5]에서 domination이론을 사용하여 네트워크의 정확한 신뢰도 계산을 위한 새로운 topologic formel을 발견하였다. 이들은 이식을 통하여 그래프 G로 표현되는 어떤 시스템이나 네트워크의 신뢰도 계산을 위하여 path 또는 k-tree를 사용한 Inclusion-Exclusion식에 나타나는 항들(=2$^{m}$ -1, m은 path나 k-tree의 수)중 서로 소거되지 않는 항들은 그래프 G의 acyclic k-부분그래프(subgraph)와 1대 1로 상응되며, cyclic-과 k-부분그래프들에 상응되는 항들은 소거되어지거나 Inclusion-Exclusion식에 나타나지 않는 -결국 신뢰도계산에 필요없는- 항들임을 밝혔다. 이들은 이성질을 이용하여 그래프 G의 정확한 신뢰도계산을 위한 빠른 알고리즘을 제시하였다. 이 알고리즘은 결국 그래프 G의 path나 k-tree를 기초로 하는 Inclusion-Exclusion식에서 나타나는 항들중 소거되지 않는 항들에 1:1로 대응하는 acyclic k-subgraph만을 찾아 신뢰도계산을 할수있게 하여 준다. 이때 acyclic k-subgraph들은 각각의 domination을 갖으며, 이들은 Inclusion-Exclusion식에서 대응되는 항의 부호들의 합과 같다. 본 논문에서는 첫째로 신뢰도계산을 위하여 주어진 어떤 그래프 G에서 G를 구성하는 선(edge)을 기초로 하는 어떤 임의로 주어진 family M(G) (예: cutset이나 path, 또는 k-tree 등의 family)에 의한 (부분)그래프의 domination에 대한 성질을 관찰하고 몇가지 식을 유도한후, k-tree의 family K(G)를 기초로 한 어떤 그래프의 domination과 Inclusion-Exclusion식과의 관계를 고찰하고, 이식의 강력함과 응용의 가능성을 A. Satyanarayana의 topologic formel의 재증명을 통하여 보인다.

• 디지털산업정보학회논문지
• /
• 제11권3호
• /
• pp.79-90
• /
• 2015

Multipath routing technique is recognized as one of the effective approaches to improve the reliability of data forwarding. However, the traditional multipath routing focuses only on how many paths are needed to ensure a desired reliability. For this purpose, the protocols construct additional paths and thus cause significant energy consumption. These problems have motivated the study for the energy-efficient and reliable data forwarding. Thus, this paper proposes an energy-efficient concurrent multipath routing protocol with a small number of paths based on interaction between paths. The interaction between paths helps to reinforce the multipath reliability by making efficient use of resources. The protocol selects several nodes located in the radio overlapped area between a pair of paths as bridge nodes for the path-interaction. In order to operate the bridge node efficiently, when the transmission failure has detected by overhearing at each path, it performs recovery transmission to recover the path failure. Simulation results show that proposed protocol is superior to the existing multipath protocols in terms of energy consumption and delivery reliability.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 1991년도 추계종합학술발표회논문집
• /
• pp.145-149
• /
• 1991

In this paper, an algorithm is proposed to analyze the approximating reliability of the capacity considered communication networks. In the case ofthe former methods to evaluate the source-to-termianl node reliability, it is very difficult to contract and delete the jointed terms in the simple path group. Therefore, the reliability bounds are used and compared to the exact reliability by TURBO PROLOG, the natural lanquage of artficial intelligence. In the reliability bounds, the upper bound used the valid cutset that isthe group of simple path and the lower bound used the minimal cutset by complement operation and the esact reiability is compared to this reliability bounds.