Before revision:  Accordingly, the goal of this paper is to analyze, using a queuing theoretical approach, the download time in storage systems that employ availability codes . For data access, we consider the widely adopted Fork-Join model with redundancy.
After revision:  Accordingly, the goal of this paper is to analyze, using a queuing theoretical approach, the download time of systematic availability codes considering the Fork-Join model with redundancy.