Results 251 to 260 of about 14,483,123 (286)
Some of the next articles are maybe not open access.
All-terminal network reliability estimation using convolutional neural networks
Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability, 2020Estimating the all-terminal network reliability by using artificial neural networks (ANNs) has emerged as a promissory alternative to classical exact NP-hard algorithms. Approaches based on traditional ANNs have usually considered the network reliability upper bound as part of the inputs, which implies additional time-consuming calculations during both
Alex Davila-Frias, Om Prakash Yadav
openaire +1 more source
Genetic algorithm design of networks considering all terminalreliability [PDF]
, 1997 The use of computer communication networks has bean rapidly increasing recently to 1) share expensive hardware and software resources, and 2) provide access to main systems from distant locations. The reliability and the cast of these systems are important considerations that are largely determined by placement of the nodes and the links between nodes.
Smith, AE, Altiparmak, F, Dengiz, B
openaire +3 more sources
Bounds for All-Terminal Reliability in Planar Networks
1987A communication network can be modeled as a graph where the nodes of the graph represent the sites, and the edges represent the links between the sites. The edges of the graph operate with equal probability p . The all-terminal reliability of the network with n nodes and b edges can be written as where F i is the number of connected subgraphs ...
Aparna Ramesh +2 more
openaire +1 more source
A Greedy Algorithm for Faster Feasibility Evaluation of All-Terminal-Reliable Networks
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2011Although calculating the all-terminal reliability (ATR) of a stochastic network is a computationally expensive task, deciding whether the ATR is greater than a preset value could be done with less effort. This study proposes a new method that generates the sequential lower and upper bounds of the ATR, based on greedy network factoring.
Jin-Myung Won, Fakhreddine Karray
openaire +2 more sources
Heuristic optimization of network design considering all-terminal reliability
Annual Reliability and Maintainability Symposium, 2002This paper describes a heuristic optimization approach using genetic algorithms. The method solves general network design problems to optimality, or near-optimality, with respect to reliability. The optimization formulation in this paper relaxes the previous restrictions that appear in the literature.
D.L. Deeter, A.E. Smith
openaire +1 more source
Combining vertex decompositions with factoring in an all-terminal network reliability algorithm
Microelectronics Reliability, 1990Abstract The all-terminal network reliability problem is to determine the probability that all nodes can communicate in a network in which edges may fail independently of each other. One well known type of algorithm for treating this problem involves repeated deletion and contraction of edges in the network.
Lavon B. Page, Jo Ellen Perry
openaire +1 more source
All-Terminal Network Reliability Optimization in Fading Environment via Cross Entropy Method
2010 IEEE International Conference on Communications, 2010This paper presents a new algorithm that can be readily applied to solve all-terminal network reliability optimization problem of a wireless network in a fading environment. The optimization problem solved considers finding the optimal topological layout of links at which the all-terminal network reliability is maximized by controlling the nodes ...
S. Kharbash, Wenye Wang
openaire +1 more source
Omega, 2007
Abstract Given the pervasive nature of computer and communication networks, many paradigms have been used to study their properties and performances. In particular, reliability models based on topological properties can adequately represent the network capacity to survive failures of its components.
Héctor Cancela, Louis Petingi
openaire +1 more source
Abstract Given the pervasive nature of computer and communication networks, many paradigms have been used to study their properties and performances. In particular, reliability models based on topological properties can adequately represent the network capacity to survive failures of its components.
Héctor Cancela, Louis Petingi
openaire +1 more source
All-Terminal Reliability Analysis of Wireless Networks of Redundant Radio Modules
IEEE Internet of Things Journal, 2016Due to the low cost of easy-to-use components of open-source hardware and software, the Internet of Things may be pervading through everything everywhere. The dependability of the Internet of Things is critical because the services will be concerned with real life. However, the inexpensive hardware provides limited resources for communication.
openaire +1 more source
Optical Fiber Technology, 2017
Abstract With the increase of the number of sensors and nodes, the existing self-healing evaluation models for large-scale optical fiber sensor networks (OFSNs) have become insufficient to evaluate their self-healing capability. Here, we propose a self-healing evaluation model using the All-terminal reliability function for OFSNs.
Dagong Jia +5 more
openaire +1 more source
Abstract With the increase of the number of sensors and nodes, the existing self-healing evaluation models for large-scale optical fiber sensor networks (OFSNs) have become insufficient to evaluate their self-healing capability. Here, we propose a self-healing evaluation model using the All-terminal reliability function for OFSNs.
Dagong Jia +5 more
openaire +1 more source