Significant methodological progress has taken place to quantify the reliability of networked systems over the past decades. Both numerical and analytical methods have enjoyed improvements via a host of advanced Monte Carlo simulation strategies, state space partition methods, statistical learning, and Boolean functions among others. The latter approach exploits logic to approximate network reli...

The purpose of this paper is to describe an efficient Boolean algebraic algorithm to compute the probability of a union of non-disjoint sets as applied to symbolic reliability analysis. Coherent networks and fault-trees with statisticallyindependent components characterized by their minimal pathsets or cutsets are used as examples for generating the non-disjoint sets. The algorithm uses the con...

Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...

A complex repairable computer-based test (CBT) network system studied in this paper consists of three client computers, a load balancer, two database servers, with the centralized server structured series configuration. Subsystem 1 homogeneous clients arranged parallel configuration, subsystem 2 comprises 3 is comprised distributed servers arrangement and 4 server. Through transition diagram, f...

HLP (hub location problem) tries to find locations of hub facilities and assignment of nodes to extended facilities. Hubs are facilities to collect, arrange, and distribute commodities in telecommunication networks, cargo delivery systems, etc. Hubs are very crucial and their inaccessibility impresses on network whole levels. In this paper, first, total reliability of the network is defined bas...

The exact calculation of all-terminal network reliability is an NP-hard problem, with computational e!ort growing exponentially with the number of nodes and links in the network. During optimal network design, a huge number of candidate topologies are typically examined with each requiring a network reliability calculation. Because of the impracticality of calculating all-terminal network relia...

The main goal of this research is to assess socio- psychotic factors affecting the application ICTsby facultymembers in Islamic Azad University. Simple random sampling method was used. Given that the presentsurvey has a descriptive-field plan and questionnaire is measurement tool that reliability and validity of thistool was confirmed. The results of study show that nine variables affect the ap...

The aim of this paper is to study the global reliability of communication networks. We assume that, in a communication network, the weights of the edges quantify the volume or the quality of the information transmitted by the nodes. In such a case, the strength of a path (resp. walk), called the reliability of the path (resp. walk) can be calculated as the product of the weights of the edges be...