Before revision:  For data access, we consider the widely adopted Fork-Join model with redundancy. In this model, each request arrival splits into multiple copies and completes as soon as any one of the copies finishes service. We first carry out the analysis under the low-traffic regime in which case the system consists of at most one download request at any time.
After revision:  For data access, we consider the widely adopted Fork-Join scheme for data access. With the Fork-Join access scheme, each data request is replicated (forked) to the systematic server containing the object and all of its recovery groups. For low-traffic regime in which case the system consists of at most one download request at any time.