A branch-and-bound approach to the optimization of redundant software under failure correlation

A branch-and-bound approach to the optimization of redundant software under failure correlation

0.00 Avg rating0 Votes
Article ID: iaor2003172
Country: United Kingdom
Volume: 29
Issue: 13
Start Page Number: 1773
End Page Number: 1791
Publication Date: Nov 2002
Journal: Computers and Operations Research
Authors: ,
Keywords: programming: branch and bound, programming: dynamic
Abstract:

A technique for computing optimal redundancy levels for the components of a fault-tolerant system with dependently failing redundant module versions is presented. Optimization is done under a given budget constraint and with the overall reliability as the objective. Within each component, price and estimated reliability of each redundant version are assumed to be constant. For solving the optimization problem, a branch-and-bound technique, using the solutions of continuous problem relaxations for the determination of bounds, is developed. Computational experiments with randomly generated test instances show that the suggested algorithm still performs well in situations where a computation based on dynamic programming is not feasible anymore.

Reviews

Required fields are marked *. Your email address will not be published.