Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in OS and Networks
Replica Placement For Availability In The Worst Case, Peng Li, Debin Gao, Mike Reiter
Replica Placement For Availability In The Worst Case, Peng Li, Debin Gao, Mike Reiter
Research Collection School Of Computing and Information Systems
We explore the problem of placing object replicas on nodes in a distributed system to maximize the number of objects that remain available when node failures occur. In our model, failing (the nodes hosting) a given threshold of replicas is sufficient to disable each object, and the adversary selects which nodes to fail to minimize the number of objects that remain available. We specifically explore placement strategies based on combinatorial structures called t-packings; provide a lower bound for the object availability they offer; show that these placements offer availability that is c-competitive with optimal; propose an efficient algorithm for computing …