Results 211 to 220 of about 376,245 (265)
Some of the next articles are maybe not open access.
Least reliable networks and the reliability domination
IEEE Transactions on Communications, 1990Summary: A well-known model in communication network reliability consists of an undirected graph \(G\) whose edges operate independently with the same probability \(p\). Then the reliability, \(R(G,p)\) of \(G\), is the probability that \(G\) is connected. It is known that \(R(G,p)\) is a polynomial in \(p\) and its coefficients are invariants of \(G\).
Francis T. Boesch +2 more
openaire +2 more sources
Bounding the Reliability of Networks
The Journal of the Operational Research Society, 1992Summary: Various applied problems require the analysis of systems with randomly failing elements. A typical such instance occurs in assessing the reliability of a transportation or communication network, in which the individual links fail independently with known probabilities. One is then interested in the probability that goods or information will be
Shier, D. R., Liu, N.
openaire +2 more sources
Reliability and communications networks
Bell Labs Technical Journal, 2006Reliability is an important aspect and requirement for communications network products. The end users experience of reliability is minimal disruption of service; while, for service providers and equipment suppliers, a key driver for high reliability is the ability to manage the maintenance costs associated with operating large, complex networks.
Anil Macwan +2 more
openaire +1 more source
Reliability of network topologies
IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?, 2003The authors present some analytical results which can be used to compute network reliability. Some simple techniques to make asymptotic approximations based on parameters of the network topology are derived. Explicit reliability formulae are computed for four network topologies, including the star and counterrotating ring.
G. A. Ray, J. J. Dunsmore
openaire +1 more source
Proceedings of the 8th annual international conference on Mobile computing and networking - MobiCom '02, 2002
We present two systems, reliable sockets (rocks) and reliable packets (racks), that provide transparent network connection mobility using only user- level mechanisms. Each system can detect a connection failure within seconds of its occurrence, preserve the endpoint of a failed connection in a suspended state for an arbitrary period of time, and ...
Victor C. Zandy, Barton P. Miller
openaire +1 more source
We present two systems, reliable sockets (rocks) and reliable packets (racks), that provide transparent network connection mobility using only user- level mechanisms. Each system can detect a connection failure within seconds of its occurrence, preserve the endpoint of a failed connection in a suspended state for an arbitrary period of time, and ...
Victor C. Zandy, Barton P. Miller
openaire +1 more source
Operations Research, 1979
This paper presents an algorithm to compute reliability measures on a stochastic network in which both nodes and links can fail. The measures considered are the probability that nodes s and t can communicate for all node pairs s and t, the probability that all operative node pairs can communicate, and the expected number of node pairs communicating ...
openaire +1 more source
This paper presents an algorithm to compute reliability measures on a stochastic network in which both nodes and links can fail. The measures considered are the probability that nodes s and t can communicate for all node pairs s and t, the probability that all operative node pairs can communicate, and the expected number of node pairs communicating ...
openaire +1 more source
On the design of reliable networks
Networks, 1973AbstractThis paper is concerned with construction of graphs, with n vertices and m edges, whose connectivity r = [2m/n] ≧ 3, and have no more than n minimum vertex cut‐sets. Frank's results imply that this is an important step in the design of a class of reliable networks.
S. Louis Hakimi, Ashok T. Amin
openaire +2 more sources
Research on reliability of complex network for estimating network reliability
Journal of Intelligent & Fuzzy Systems, 2017Network reliability is an important index in measuring the reliability of large-sized network, but network reliability calculation is a NP-hard problem, and simulation is a feasible approach to estimating network reliability. Aiming at the problem of reliability evaluation in a complex network, develop a general scheme that combines Crude Monte Carlo ...
openaire +1 more source
Reliable Networks with Unreliable Sensors
Pervasive and Mobile Computing, 2011Wireless sensor networks (WSNs) deployed in hostile environments suffer from a high rate of node failure. We investigate the effect of such failure rate on network connectivity. We provide a formal analysis that establishes the relationship between node density, network size, failure probability, and network connectivity.
Srikanth Sastry +3 more
openaire +1 more source