Update-efficient codes for erasure correction

@article{Anthapadmanabhan2010UpdateefficientCF,
  title={Update-efficient codes for erasure correction},
  author={Nagaraj Prasanth Anthapadmanabhan and Emina Soljanin and Sriram Vishwanath},
  journal={2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)},
  year={2010},
  pages={376-382}
}
The problem of designing codes to protect against server failures in a distributed storage system for frequently changing data is considered. When the original data changes, the coded packets stored on the servers must be updated accordingly. Since performing updates consumes costly bandwidth and energy, it is of interest to construct codes that have small update complexity, which we define as the maximum number of coded symbols that must be updated when any single information symbol is changed… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS

Citations

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

Balanced locally repairable codes

2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) • 2016
View 10 Excerpts
Highly Influenced

Consistent distributed storage of correlated data updates via multi-version coding

2016 IEEE Information Theory Workshop (ITW) • 2016
View 6 Excerpts
Highly Influenced

Update-Efficiency and Local Repairability Limits for Capacity Approaching Codes

IEEE Journal on Selected Areas in Communications • 2014
View 4 Excerpts
Highly Influenced

Some Results on Update Complexity of a Linear Code Ensemble

2011 International Symposium on Networking Coding • 2011
View 4 Excerpts
Highly Influenced

DR-Update: A Dual-Level Relay Scheme in Erasure-Coded Storage Systems for Balanced Updates

2017 IEEE 15th Intl Conf on Dependable, Autonomic and Secure Computing, 15th Intl Conf on Pervasive Intelligence and Computing, 3rd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech) • 2017
View 2 Excerpts

References

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

Private codes or succinct random codes that are (almost) perfect

45th Annual IEEE Symposium on Foundations of Computer Science • 2004
View 5 Excerpts
Highly Influenced

LT Codes

FOCS • 2002
View 3 Excerpts
Highly Influenced

Network Coding Strategies for Data Persistence in Static and Mobile Sensor Networks

2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops • 2007
View 1 Excerpt

Erasure Codes for Increasing the Availability of Grid Data Storage

Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW'06) • 2006
View 3 Excerpts

Network Coding for Joint Storage and Transmission with Minimum Cost

2006 IEEE International Symposium on Information Theory • 2006
View 1 Excerpt

Similar Papers

Loading similar papers…