Results 221 to 230 of about 376,245 (265)

Design of reliable networks

[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Optimally reliable networks

Annals of Operations Research, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Network transformations and bounding network reliability

Networks, 1993
AbstractThree transformations on networks that reduce the all‐terminal network reliability (probability of connectedness) of a network are shown not to increase any coefficient in one form of the reliability polynomial of the network. These transformations yield efficiently computable lower bounds on each coefficient of the reliability polynomial.
Jason I. Brown, Charles J. Colbourn, John S. Devitt   +2 more
openaire   +2 more sources

Bayesian Assessment of Network Reliability

SIAM Review, 1998
Summary: The recent technological advances in communications, manufacturing, and transportation systems have made networks the mainstay of modern life. Consequently, the reliability of networks has become an important issue and much progress has been made in its assessment. However, the state of the art here suffers from a serious limitation.
Nicholas Lynn, Nozer D. Singpurwalla, Adrian Smith   +2 more
openaire   +2 more sources

Reliability comparison of computer networks

IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?, 2003
The authors consider networks modeled as directed graphs with a uniform link failure probability (q) and develop an algorithm which permits not only a symbolic reliability evaluation, but also a comparison of different topologies to verify if a particular one is uniformly maximally reliable, i.e. it has the best reliability for any value of q.
P. Camarda, M. Gerla
openaire   +2 more sources

Reliability Computations for Planar Networks

ORSA Journal on Computing, 1990
The two-terminal reliability problem for an undirected network involves calculating the probability that two distinguished sites are connected by a path of working edges. This problem is known to be NP-hard, even for the special case of planar systems.
David E. Whited, Douglas R. Shier, James P. Jarvis   +2 more
openaire   +1 more source

A Sharp Threshold for Network Reliability

Combinatorics, Probability and Computing, 2002
Given a graph G on n vertices with average degree d, form a random subgraph Gp by choosing each edge of G independently with probability p. Strengthening a classical result of Margulis we prove that, if the edge connectivity k(G) satisfies k(G) [Gt ] d/log n, then the connectivity threshold in Gp is sharp. This result is asymptotically tight.
Michael Krivelevich, Benny Sudakov, Van H. Vu   +2 more
openaire   +2 more sources

Bounds on the Reliability of Networks

IEEE Transactions on Reliability, 1986
This paper presents criteria for acceptable schemes to approximate system reliability and investigates such schemes for a special class of network reliability problems. In this framework, we are able to use powerful combinatorial theory to obtain strong bounds for network reliability which can be computed by efficient algorithms.
openaire   +2 more sources

An Algorithm for Network Reliability Bounds

ORSA Journal on Computing, 1990
We provide a new algorithm for assessing network reliability (and performability, the more general case). As in some well-known approaches, the algorithm identifies most probable states in iterations and provides converging upper and lower bounds after each iteration.
Che-Liang Yang, Peter Kubat
openaire   +2 more sources

Reliability of A Tree Network

IEEE Transactions on Reliability, 1976
This paper presents a mathematical model for computing the reliability of a system with redundant components in a tree configuration. This model is quite general and can be applied to any system representable by the appropriate tree. A typical example is cited.
openaire   +2 more sources