Results 211 to 220 of about 91,855 (262)
Some of the next articles are maybe not open access.
Classes of uniformly most reliable graphs for all-terminal reliability
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kassie Archer +2 more
exaly +2 more sources
Improvements in the Efficiency of Cumulative Updating of All-Terminal Network Reliability
IEEE Transactions on Reliability, 2012This paper contains some algorithms and recommendations that enable increasing efficiency of cumulative updating of all-terminal reliability for a network with unreliable links. The existence of cutnodes, 2-node cuts, and chains in a network structure can be used for faster calculations.
Alexey Rodionov, Denis Migov
exaly +2 more sources
All-terminal network reliability optimization via probabilistic solution discovery
Reliability Engineering and System Safety, 2008This paper presents a new algorithm that can be readily applied to solve the all-terminal network reliability allocation problems. The optimization problem solved considers the minimization of the network design cost subject to a known constraint on all-terminal reliability by assuming that the network contains a known number of functionally equivalent
JOSÉ Emmanuel Ramirez Marquez +1 more
exaly +2 more sources
On Parallel Calculation of All-Terminal Network Reliability
2021 17th International Asian School-Seminar "Optimization Problems of Complex Systems (OPCS), 2021The paper presents parallel algorithms for calculating the exact value of all-terminal reliability of a network with unreliable edges and absolutely reliable nodes. A random graph is used as a model of such network. The algorithms are based on the factorization procedure which is a well-known sequential method of a reliability calculation ...
Kirill Sergeev, Denis Migov
openaire +1 more source
Rational roots of all‐terminal reliability
Networks, 2020AbstractGiven a connected graph G whose vertices are perfectly reliable and whose edges each fail independently with probability q ∈ [0, 1], the (all‐terminal) reliability of G is the probability that the resulting subgraph of operational edges contains a spanning tree (this probability is always a polynomial in q).
Jason I. Brown, Corey D. C. DeGagné
openaire +2 more sources
An Algorithm to Compute the All-terminal Reliability Measure
OPSEARCH, 2001In the evaluation of the reliability of a multi-component system, the most important among several models fit into the class of stochastic graph models, for which an exact evaluation of reliability metrics is costly since these are classed in the NP-hard family As a consequence, many computation methods exist.
Cancela, Héctor +2 more
openaire +2 more sources
Nonexistence of optimal graphs for all terminal reliability
Networks, 2013AbstractSuppose that every edge of a graph G (finite and undirected) is independently operational with probability . The all terminal reliability of G is the probability that all vertices can communicate. It was conjectured that among all graphs with n vertices and m edges there always exists a most optimal graph, that is, one whose all terminal ...
Jason I. Brown, Danielle Cox
openaire +1 more source
Bounding all‐terminal reliability in computer networks
Networks, 1988AbstractMany bounds for the all‐terminal reliability of computer networks have been proposed. Of those computable in polynomial time, the Ball‐Provan bounds and the Lomonosov Polesskii bounds provide the tightest estimates. A strategy is developed here using linear programming to obtain bounds which are tighter than both the Lomonosov‐Polesskii and the
Charles J. Colbourn, Daryl D. Harms
openaire +1 more source
Simulation of all-terminal reliability of an undirected network using the reliability polynomial
2020 28th Telecommunications Forum (TELFOR), 2020This paper discusses the modeling of terminal network reliability using reliability polynomials. A simulator was developed and its results compared with the values of the reliability polynomial. The lack of exact methods for calculating reliability polynomials is considered and an approximate method for calculating reliability polynomials covering the ...
Aleksandar Paripović +2 more
openaire +1 more source