Results 231 to 240 of about 24,617 (263)

Reliability polynomials and link importance in networks

IEEE Transactions on Reliability, 1994
The reliability polynomial is a graph invariant which is of interest where graphs are used as models of systems such as communication networks, computer networks, and transportation networks. This paper examines the use of reliability polynomials to rank the edges in a graph in terms of overall importance to graph reliability. For a given edge e in the
L.B. Page, J.E. Perry
openaire   +1 more source

Commentary on: reliability polynomials and link importance in networks

IEEE Transactions on Reliability, 2000
The author comments on the paper by L.B. Page et al., (see ibid., vol.43, p.51-8, 1994). The author considers the reliability of a communication network, represented by a graph G of nodes and edges (also called "links"); the nodes are assumed to be perfectly operational and the edges are assumed to be Y-independently operational with probability p.
openaire   +1 more source

Degree-based approximations for network reliability polynomials

Journal of Complex Networks
Abstract Two approximations for network reliability polynomials, only based upon the knowledge of the degree vector of the graph, are compared: the first-order approximation by Brown et al. and our stochastic approximation. Our method is an extension of the connectivity probability of Erdős–Rènyi random graphs.
Piet Van Mieghem, Xinhan Liu
openaire   +1 more source

Reliability polynomials can cross twice

Journal of the Franklin Institute, 1993
Abstract An example is given to demonstrate that all-terminal reliability polynomials of networks having the same number of nodes and the same number of links can cross twice as the edge operation probability ranges from 0 to 1 . A similar result is shown for two-terminal reliability.
Colbourn, Charles J., Harms, Daryl D., Myrvold, Wendy J.   +2 more
openaire   +2 more sources

Reliability polynomials of computer communication networks

Microelectronics Reliability, 1986
Abstract The expression for the overall reliability of a computer communication network (CCN) when all edges have equal probability of being up is called the reliability polynomial of the CCN. For a complicated network, the overall reliability of the CCN can be approximated by the truncated polynomial. A characterization of the reliability polynomial
Sun-Wah Kiu, D.F. McAllister
openaire   +1 more source

Bounds evaluation of coefficients in the reliability polynomial

Microelectronics Reliability, 1990
Abstract In this study a class of new methods to evaluate bounds of the reliability polynomial coefficients is proposed. These new methods enumerate progressively simple paths or p-acyclic subgraphs finding for each new term a closer lower bound.
openaire   +1 more source

Reliability polynomials crossing more than twice.

2011
In this paper we study all-terminal reliability polynomials of networks having the same number of nodes and the same number of links. First we show that the smallest possible size for a pair of networks that allows for two crossings of their reliability polynomials have seven nodes and fifteen edges.
Brown, J.I., Koç, Y., Kooij, R.E.
openaire   +2 more sources

Structural reliability analysis by a Bayesian sparse polynomial chaos expansion

Structural Safety, 2021
Biswarup Bhattacharyya
exaly  

An axiomatic characterization of the reliability polynomial

1991
Richard P. McLean, Douglas H. Blair
openaire   +1 more source

On the Roots of Certain Reliability Polynomials

2022
Leonard Dăuş, Vlad-Florin Drăgoi, Marilena Jianu, Dominic Bucerzan, Valeriu Beiu   +4 more
openaire   +1 more source