Results 1 
5 of
5
Distributed File Allocation with Consistency Constraints
 in Proceedings of the International Conference on Distributed Computing Systems
, 1992
"... We consider the resource allocation problem in distributed computing systems that have strict mutual consistency requirements. Our model incorporates the behavior of consistency control algorithms, which ensure that mutual consistency of replicated data is preserved even when communication links of ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
We consider the resource allocation problem in distributed computing systems that have strict mutual consistency requirements. Our model incorporates the behavior of consistency control algorithms, which ensure that mutual consistency of replicated data is preserved even when communication links of the computer network and/or computers on which the files reside fail. The problem of resource allocation in these networks is significant in terms of the efficiency of operations and the reliability of the network. The constrained resource allocation problem is formulated as a mixed nonlinear integer program. An efficient algorithm is proposed to solve this problem. The performance of the algorithm is evaluated in terms of the algorithm's accuracy, efficiency and execution times, using a representative problem set. 1 Introduction Consider a distributed computing system (DCS) that is made up of a set of sites (nodes) connected through communication links which transmit information from one s...
SeriesParallel Reductions in Monte Carlo Network Reliability Evaluation
"... this paper, we show that seriesparallel reductions can be incorporated to the Recursive Variance Reduction simulation method, leading to a more efficient estimator ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
this paper, we show that seriesparallel reductions can be incorporated to the Recursive Variance Reduction simulation method, leading to a more efficient estimator
Combinatorial Approach to Reliability Evaluation of Network with Unreliable Nodes and Unreliable Edges
, 2006
"... Estimating the reliability of a computer network has been a subject of great interest. It is a well known fact that this problem is NPhard. In this paper we present a very efficient combinatorial approach for Monte Carlo reliability estimation of a network with unreliable nodes and unreliable edges ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Estimating the reliability of a computer network has been a subject of great interest. It is a well known fact that this problem is NPhard. 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 computed, directly provide pure and simple framework for computation of network reliability. As a specific case of this approach we obtain tight lower and upper bounds for distributed network reliability (the so called residual connectedness reliability). We also present some simulation results.
Combining Network Reductions and Simulation to Estimate Network Reliability
"... Network reduction techniques are mainly used with exact approaches such as factoring to compute network reliability. However, exact computation of network reliability is feasible only for small sized networks. Simulation is an alternative approach to estimate network reliability. This paper discuses ..."
Abstract
 Add to MetaCart
Network reduction techniques are mainly used with exact approaches such as factoring to compute network reliability. However, exact computation of network reliability is feasible only for small sized networks. Simulation is an alternative approach to estimate network reliability. This paper discuses the effect of using network reductions before estimating network reliability using a simulation. Theoretical and empirical results are provided to understand the source of variance reduction in simulation due to network reductions. 1
International Journal of Electrical and Computer Engineering 1:3 2006 Combinatorial Approach to Reliability Evaluation of Network with Unreliable Nodes and Unreliable Edges
"... Abstract—Estimating the reliability of a computer network has been a subject of great interest. It is a well known fact that this problem is NPhard. In this paper we present a very efficient combinatorial approach for Monte Carlo reliability estimation of a network with unreliable nodes and unrelia ..."
Abstract
 Add to MetaCart
Abstract—Estimating the reliability of a computer network has been a subject of great interest. It is a well known fact that this problem is NPhard. 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 computed, directly provide pure and simple framework for computation of network reliability. As a specific case of this approach we obtain tight lower and upper bounds for distributed network reliability (the so called residual connectedness reliability). We also present some simulation results. Keywords—Combinatorial invariants, Monte Carlo simulation, reliability, unreliable nodes and unreliable edges