Tytuł:

Determining s-t and K-terminal path sets and cut sets in graph-modeled networks by a unified approach

Inny tytuł:

Raport Badawczy = Research Report ; RB/18/2011

Twórca:

Malinowski, Jacek

Wydawca:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Miejsce wydania:

Warszawa

Data wydania/powstania:

2011

Opis:

22 pages ; 21 cm ; Bibliography p. 22

Temat i słowa kluczowe:

Teoria grafów ; Graph theory ; Reliability analysis of network ; Analiza niezawodności systemów sieciowych ; S-t cut ; S-t cięcie ; Path sets ; Cut sets ; Zestawy ścieżek ; Zestawy cięć ; K-terminal

Abstrakt:

The current paper presents a set of algorithms for finding minimal path and cut sets of various types in graph-structured networks (computer, telecommunication, transportation, etc.) Those sets are crucial in reliability analysis of network systems. The presented methodology is based on the construction of the acyclic paths tree, where each path connects two nodes of the considered network. Based on this tree the s-t minimal paths are readily obtained, and after minor transformations the so-called simplified fault tree is constructed from which the s-t minimal cuts are determined.

Czasopismo/Seria/cykl:

Raport Badawczy = Research Report

Typ zasobu:

Text

Szczegółowy typ zasobu:

Report

Źródło:

RB-2011-18

Język:

eng

Język streszczenia:

eng

Prawa:

Creative Commons Attribution BY 4.0 license

Zasady wykorzystania:

Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -

Digitalizacja:

Systems Research Institute of the Polish Academy of Sciences

Lokalizacja oryginału:

Library of Systems Research Institute PAS

Dofinansowane ze środków:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Dostęp:

Open