The reliability polynomial of a graph gives the probability that remains operational when all its edges could fail independently with certain fixed probability. In general, problem finding uniformly most reliable graphs inside family graphs, is, one whose is at least as large any other family, very difficult. this paper, we study in containing hamiltonian cycle.

we compare two approaches for a markovian model in flexible manufacturing systems (fmss) using monte carlo simulation. the model which is a development of fazlollahtabar and saidi-mehrabad (2013), considers two features of automated flexible manufacturing systems equipped with automated guided vehicle (agv) namely, the reliability of machines and the reliability of agvs in a multiple agv jobsho...

Nowadays, faults and failures are increasing especially in complex systems such as Network-on-Chip (NoC) based Systems-on-a-Chip due to the increasing susceptibility and decreasing feature sizes. On the other hand, fault-tolerant routing algorithms have an evident effect on tolerating permanent faults and improving the reliability of a Network-on-Chip based system. This paper presents reliabili...

Each system has its own definition of reliability. Reliability in mobile ad-hoc networks (MANET) could be interpreted as, the probability of reaching a message from a source node to destination, successfully. The variability and volatility of the MANET configuration makes typical reliability methods (e.g. reliability block diagram) inappropriate. It is because, no single structure or configurat...

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 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...

The exact calculation of all-terminal network reliability is an NP-hard problem, with computational effort growing exponentially with the number of nodes and links in the network. Because of the impracticality of calculating allterminal network reliability for networks of moderate to large size, Monte Carlo simulation methods to estimate network reliability and upper and lower bounds to bound r...