Estimation of Network Reliability for a Fully Connected Network with Unreliable Nodes and Unreliable Edges using Neuro Optimization

نویسندگان

  • Diwakar Bhardwaj Computer Engineering, , GLA Institute of Technology and Management, Math
چکیده مقاله:

In this paper it is tried to estimate the reliability of a fully connected network of some unreliable nodes and unreliable connections (edges) between them. The proliferation of electronic messaging has been witnessed during the last few years. The acute problem of node failure and connection failure is frequently encountered in communication through various types of networks. We know that a network can be defined as an undirected graph N(V,E). It is believed that in a network the nodes as well as the connections can fail and hence can cause unsuccessful communication. So, it is important to estimate the network reliability to encounter the network failure. Various tools have been used to estimate the reliability of various types of networks. In this paper we are considering the approach of neuro optimization for estimating the network reliability. We use the simulation annealing to estimate the probabilities of various nodes in the network and Hopfield model to calculate the energies of these nodes at various thermal equilibriums. The state of the minimum energy represents the maximum reliability state of the network.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial Approach to Reliability Evaluation of Network with Unreliable Nodes and Unreliable Edges

Estimating the reliability of a computer network has been a subject of great interest. It is a well known fact that this problem is NP-hard. In this paper we present a very efficient combinatorial approach for Monte Carlo reliability estimation of a network with unreliable nodes and unreliable edges. Its core is the computation of some network combinatorial invariants. These invariants, once co...

متن کامل

Networks with Unreliable Nodes and Edges: Monte Carlo Lifetime Estimation

Estimating the lifetime distribution of computer networks in which nodes and links exist in time and are bound for failure is very useful in various applications. This problem is known to be NP-hard. In this paper we present efficient combinatorial approaches to Monte Carlo estimation of network lifetime distribution. We also present some simulation results. Keywords—Combinatorial spectrum, Mon...

متن کامل

An Efficient Evaluation for the Reliability Upper Bound of Distributed Systems with Unreliable Nodes and Edges

The distributed systems in which nodes and/or edges may fail with certain probabilities have been modelled by a probabilistic network or a graph G. Computing the residual connectedness reliability (RCR), denoted by R(G), of probabilistic networks under the fault model with both node and edge faults is very useful, but is an NP-hard problem. Since it may need exponential time of the network size...

متن کامل

Routing in a network with unreliable components

A new approach to the joint selection of primary and secondary routes in a network with unreliable components is presented. The mathematical model captures the changes in the operational characteristics of the network when it adapts to failures. Lagrangean relaxation and subgradient optimization techniques are used to obtain good heuristic solutions to the problem, as well as lower bounds to be...

متن کامل

Facility Location on a Network with Unreliable Links

In this paper we study a simple vulnerability-based stochastic dependency model of link failures in a network prone to disasters. Under this model, we study the problem of locating k facilities to maximize the expected demand serviced within a given distance, and show its equivalence to the well-studied maximum k-facility location problem. In the special case when there is no distance constrain...

متن کامل

assessment of the efficiency of s.p.g.c refineries using network dea

data envelopment analysis (dea) is a powerful tool for measuring relative efficiency of organizational units referred to as decision making units (dmus). in most cases dmus have network structures with internal linking activities. traditional dea models, however, consider dmus as black boxes with no regard to their linking activities and therefore do not provide decision makers with the reasons...

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 22  شماره 4

صفحات  317- 332

تاریخ انتشار 2009-11-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023