Coding for fast content download

@article{Joshi2012CodingFF,
  title={Coding for fast content download},
  author={Gauri Joshi and Yanpei Liu and Emina Soljanin},
  journal={2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)},
  year={2012},
  pages={326-333}
}
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… CONTINUE READING
Highly Cited
This paper has 67 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 48 extracted citations

Approximations and Bounds for (n, k) Fork-Join Queues: A Linear Transformation Approach

2018 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID) • 2018
View 6 Excerpts
Highly Influenced

Which Achieves Lower Latency with Redundant Requests, Replication or Coding?

GLOBECOM 2017 - 2017 IEEE Global Communications Conference • 2017
View 5 Excerpts
Highly Influenced

Heuristics for Analyzing Download Time in MDS Coded Storage Systems

2018 IEEE International Symposium on Information Theory (ISIT) • 2018
View 8 Excerpts

67 Citations

01020'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 67 citations based on the available data.

See our FAQ for additional information.

References

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

Codes can reduce queueing delay in data centers

2012 IEEE International Symposium on Information Theory Proceedings • 2012
View 2 Excerpts

Toward sustainable networking: Storage area networks with network coding

2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton) • 2012
View 2 Excerpts

Exploiting route diversity in multi-packet transmission using mutual information accumulation

2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton) • 2011
View 1 Excerpt

Update efficient codes for distributed storage

2011 IEEE International Symposium on Information Theory Proceedings • 2011
View 2 Excerpts

Reducing delay with coding in (mobile) multi-agent information transfer

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) • 2010
View 1 Excerpt

Explicit construction of optimal exact regenerating codes for distributed storage

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) • 2009
View 1 Excerpt

Similar Papers

Loading similar papers…