We introduce the Fixed Cluster Repair System (FCRS) as a novel architecture for Distributed Storage Systems (DSS) that achieves a small repair bandwidth while guaranteeing a high availability. Specifically, we partition the set of servers in a DSS into s clusters and allow a failed server to choose any cluster other than its own as its repair group. Thereby, we guarantee an availability of s−1 . We characterize the repair bandwidth vs. storage trade-off for the FCRS under functional repair and show that the minimum repair bandwidth can be improved by an asymptotic multiplicative factor of 2/3 compared to the state of the art coding techniques that guarantee the same availability. Furthermore, we introduce cubic codes designed to minimize the repair bandwidth of the FCRS under the exact repair model. We prove an asymptotic multiplicative improvement of 0.79 in the minimum repair bandwidth compared to the existing exact repair coding techniques that achieve the same availability. We show that cubic codes are information-theoretically optimal for the FCRS with 2 and 3 complete clusters. A full version of this paper is accessible at: https://arxiv.org/pdf/1710.02653.pdf