System reliability evaluation using budget constrained real [formula omitted]-MC search

Abstract

In the network flow problems, it is the most challenging task to maintain the system reliability and high quality of service (QoS). Most of these networks are stochastic and ensuring optimal data flow under some constraints especially, budget and time, is a very challenging task. If the user’s data can be transferred within the budget then the network is called budget constrained stochastic flow network (SFN). The system reliability can be checked through minimal paths and minimal cuts in the network. In this paper, it is aimed to evaluate the system reliability of the budget constrained SFN with the help of minimal cuts in the network. The problem is to find out all the minimal cuts, such that d units of data can be communicated within a specified budget B. All the minimal cuts that satisfy budget constraint are employed for system reliability evaluation. From the results, it can be said that the proposed approach is much faster than the earlier approaches without any compromise in the network reliability.