2012 · 14 citations · 10 references
ComputingComputer EngineeringComputer ScienceGrid ComputingMessage PassingParallel ComputingDistributed ComputingMonte Carlo MethodsMonte Carlo SimulationNetwork ReliabilityReliability ModelingSimulation MethodsAd Hoc NetworksAll-terminal ReliabilityCommunication ReliabilityMessage Passing InterfaceMessage-passing AlgorithmsMonte Carlo Reliability SimulationNp-hardnessReliability Allocation
All-terminal reliability (ATR), defined as the probability that every node in a network can communicate with every other node, is an important problem in research areas such as mobile ad-hoc wireless networks, grid computing systems, and telecommunications. The assessment of ATR has also been part of related problems like the reliability allocation problem. However, the exact calculation of ATR is a NP-hard problem. To obtain this probability, there are approaches based on analytic methods for small networks or estimation through Monte Carlo simulation (MCS). In this paper, a parallel MCS implementation, based on the Message Passing Interface (MPI) standard is presented. The implementation can take advantage of the existence of multiprocessor thus reducing the time required for the ATR assessment. Three examples related to real network illustrate the benefits.
10
A Monte Carlo Sampling Plan for Estimating Network Reliability
George S. Fishman · Operations Research · 1986 · 179 citations