Mixed Fault Tolerance in Server Assignment: Combining Reinforcement and Backup
We study the mixed approach to fault tolerance in the general context of server assignment in networks. The approach is based on mixing two different existing strategies, namely, reinforcement and backup. The former strategy protects clients by reinforcing the servers assigned to them and making them fault-resistant (at a possibly high cost), while the latter protects clients by assigning to them alternate low price backup servers that can replace their primary servers in case those fail. Applying the mixed approach to fault tolerance gives rise to new fault-tolerant variations of known server assignment problems. We introduce several NP-hard problems of this type, including the mixed fault-tolerant dominating set problem, the mixed fault-tolerant centers problem, and the mixed fault-tolerant facility location problem, and present polynomial time approximation algorithms for them, demonstrating the viability of the mixed strategy for server assignment problems.
KeywordsApproximation Fault tolerance Backup Reinforcement Server assignment problems Dominating set Centers Facility location
- 1.Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)Google Scholar
- 7.Parter, M., Peleg, D.: Fault tolerant BFS structures: a reinforcement-backup tradeoff. In: 27th ACM Symposium on Parallel Algorithms and Architectures (2015)Google Scholar
- 8.Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Wiley-Interscience Series in Discrete Mathematics and Optimization (1999)Google Scholar