 When the low-traffic assumption does not hold, system consists of multiple inter-dependent Fork-Join queues, which makes exact analysis intractable due to state space explosion. Here , we present upper and lower bounds on the download time, and an M/G/1 queue approximation for several special cases of interest.
<coherence>  When the low-traffic assumption does not hold, system consists of multiple inter-dependent Fork-Join queues, which makes exact analysis intractable due to state space explosion. Here , we present upper and lower bounds on the download time, and an M/G/1 queue approximation for several special cases of interest.
 When the low-traffic assumption does not hold, system consists of multiple inter-dependent Fork-Join queues, which makes exact analysis intractable . Accordingly , we present upper and lower bounds on the download time, and an M/G/1 queue approximation for several special cases of interest.