Round-robin overlapping generations coding for fast content download

@article{Joshi2013RoundrobinOG,
  title={Round-robin overlapping generations coding for fast content download},
  author={Gauri Joshi and Emina Soljanin},
  journal={2013 IEEE International Symposium on Information Theory},
  year={2013},
  pages={2740-2744}
}
We analyze the download time of a large file, divided into chunks called generations, and transmitted over an erasure channel without feedback. For non-overlapping generations, we derive how the download time scales with the number of generations, for the round-robin and random scheduling policies. We then analyze coding with overlapping generations and show that the optimal overlap size is small compared to the number of generations, which implies that the download time can be reduced with… CONTINUE READING
5 Citations
13 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Global internet phenomena report

  • Sandvine Networks
  • Mar. 2012.
  • 2012
1 Excerpt

Round-Robin Overlapping Generations Coding for Fast Content Download

  • G. Joshi, E. Soljanin
  • Extended version, Available online, Jan. 2012.
  • 2012
2 Excerpts

Similar Papers

Loading similar papers…