Coding for fast content download

Gauri Joshi, Yanpei Liu, Emina Soljanin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

70 Scopus citations

Abstract

We study the fundamental trade-off between storage and content download time. We show that the download time can be significantly reduced by dividing the content into chunks, encoding it to add redundancy and then distributing it across multiple disks. We determine the download time for two content access models - the fountain and fork-join models that involve simultaneous content access, and individual access from enqueued user requests respectively. For the fountain model we explicitly characterize the download time, while in the fork-join model we derive the upper and lower bounds. Our results show that coding reduces download time, through the diversity of distributing the data across more disks, even for the total storage used.

Original languageEnglish (US)
Title of host publication2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
Pages326-333
Number of pages8
DOIs
StatePublished - 2012
Externally publishedYes
Event2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012 - Monticello, IL, United States
Duration: Oct 1 2012Oct 5 2012

Publication series

Name2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012

Other

Other2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
Country/TerritoryUnited States
CityMonticello, IL
Period10/1/1210/5/12

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Coding for fast content download'. Together they form a unique fingerprint.

Cite this