# An algorithm for geo-distributed and redundant storage in Garage

## TL;DR

This paper introduces an optimal algorithm for assigning data to storage nodes in a geo-distributed system, optimizing storage efficiency and redundancy while analyzing its complexity and user metrics.

## Contribution

The paper proposes a novel optimal algorithm specifically designed for data assignment in geo-distributed, redundant storage systems like Garage.

## Key findings

- Algorithm achieves optimal data placement
- Complexity analysis of each algorithm step
- Metrics for user display and system monitoring

## Abstract

This paper presents an optimal algorithm to compute the assignment of data to storage nodes in the Garage geo-distributed storage system. We discuss the complexity of the different steps of the algorithm and metrics that can be displayed to the user.