Disjointing Technique for Reliability Evaluation of Computer-Communication Networks

Source to all terminal reliability of a network is the ability of the network to transmit the commodity from source node to all other terminal nodes. The paper proposes an algorithm for source to all terminal reliability evaluation of directed networks. The algorithm starts with a spanning tree whic...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Procedia computer science Ročník 70; s. 205 - 211
Hlavní autoři: Kaushik, Kriti, Pahuja, G.L.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 2015
Témata:
Directed network
Reliability Evaluation
SAT Reliability
Spanning trees
Reliability Evaluation
Directed network
Spanning trees
SAT Reliability
ISSN:1877-0509, 1877-0509
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Source to all terminal reliability of a network is the ability of the network to transmit the commodity from source node to all other terminal nodes. The paper proposes an algorithm for source to all terminal reliability evaluation of directed networks. The algorithm starts with a spanning tree which is termed as first spanning tree (FST). All other disjoint spanning trees are generated from the knowledge of first spanning tree. Source to all terminal reliability is evaluated by taking probability of union of disjoint spanning trees. The method puts no constraint on FST selection. The proposed method is fast, efficient and no failed spanning tree is generated. The algorithm doesn’t generate duplicate spanning trees. The method is explained with the help of an example. The advantage in terms of computational complexity is also compared with the existing techniques.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2015.10.074