Random Linear Network Coding Is Key to Data Survival in Highly Dynamic Distributed Storage

  title={Random Linear Network Coding Is Key to Data Survival in Highly Dynamic Distributed Storage},
  author={M{\'a}rton Sipos and Frank H. P. Fitzek and Daniel Enrique Lucani},
  journal={2015 IEEE 81st Vehicular Technology Conference (VTC Spring)},
Distributed storage solutions have become widespread due to their ability to store large amounts of data reliably across a network of unreliable nodes, by employing repair mechanisms to prevent data loss. Conventional systems rely on static designs with a central control entity to oversee and control the repair process. Given the large costs for maintaining and cooling large data centers, our work proposes and studies the feasibility of a fully decentralized systems that can store data even on… CONTINUE READING

Figures, results, and Topics from this paper.

Key Quantitative Results

  • Our results use traces from a BitTorrent client for Android devices to show that RLNC outperforms the next best scheme (fully centralized Reed-Solomon) not only by having a much lower probability of data loss, but by reducing storage requirements by up to 50% and reconstruction traffic by up to 40%.


Publications referenced by this paper.

Number of concurrent connected users on the Steam gaming platform

  • V. Corporation
  • 2014
1 Excerpt

Saving capacity with HDFS RAID

  • W. Wang, H. Kuang
  • 2014
1 Excerpt

Similar Papers

Loading similar papers…