Fractal codes with locality and availability

Abstract Codes with locality and availability are used in distributed storage for data recovery. Locality λ enables the recovery of lost data on each server by exploiting data from only λ remaining intact servers. Availability α means that an α subset of servers providing localities are available for data recovery for each server. The secondary benefit of these codes in distributed storage is that they allow access to hot data in times of high demand, exploiting locality and availability. In this paper two families of codes with locality availability and scalability are presented which can be represented as fractals.