2021/05/06 by Tim Hellemans, Hellemans, Tim, Arti Yardi +3
Computer Science · #Advanced Data Storage Technologies #Caching and Content Delivery #Distributed systems and fault tolerance #FOS: Computer and information sciences #Performance (cs.PF) #cs.PF
paper · pdf · doi:10.48550/arxiv.2105.02926
arxiv created 2021/05/06 · openalex publication_date 2021/05/06 · arxiv updated 2021/05/10 · openalex created_date 2022/07/25 · openalex updated_date 2026/07/28
We consider a distributed storage system which stores several hot (popular) and cold (less popular) data files across multiple nodes or servers. Hot files are stored using repetition codes while cold files are stored using erasure codes. The nodes are prone to failure and hence at any given time, we assume that only a fraction of the nodes are available. Using a cavity process based mean field framework, we analyze the download time for users accessing hot or cold data in the presence of failed nodes. Our work also illustrates the impact of the choice of the storage code on the download time performance of users in the system.