Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleNovember 2023
Practical Design Considerations for Wide Locally Recoverable Codes (LRCs)
ACM Transactions on Storage (TOS), Volume 19, Issue 4Article No.: 31, Pages 1–26https://doi.org/10.1145/3626198Most of the data in large-scale storage clusters is erasure coded. At exascale, optimizing erasure codes for low storage overhead, efficient reconstruction, and easy deployment is of critical importance. Locally recoverable codes (LRCs) have deservedly ...
- posterNovember 2022
Poster: Coded Broadcast for Scalable Leader-Based BFT Consensus
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications SecurityPages 3375–3377https://doi.org/10.1145/3548606.3563494With the success of blockchains and cryptocurrencies, Byzantine Fault Tolerant state machine replication protocols have attracted considerable interest. A class of such protocols that is particularly popular are leader-based protocols, where one server (...
Snarl: entangled merkle trees for improved file availability and storage utilization
Middleware '21: Proceedings of the 22nd International Middleware ConferencePages 236–247https://doi.org/10.1145/3464298.3493397In cryptographic decentralized storage systems, files are split into chunks and distributed across a network of peers. These storage systems encode files using Merkle trees, a hierarchical data structure that provides integrity verification and lookup ...
- research-articleJanuary 2021
VidCloud: Joint Stall and Quality Optimization for Video Streaming over Cloud
ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS), Volume 5, Issue 4Article No.: 17, Pages 1–32https://doi.org/10.1145/3442187As video-streaming services have expanded and improved, cloud-based video has evolved into a necessary feature of any successful business for reaching internal and external audiences. In this article, video streaming over distributed storage is ...
- research-articleOctober 2020
Near-optimal erasure list-decodable codes
CCC '20: Proceedings of the 35th Computational Complexity ConferenceArticle No.: 1, Pages 1–27https://doi.org/10.4230/LIPIcs.CCC.2020.1A code C ⊆ (0, 1}n is (s, L) erasure list-decodable if for every word w, after erasing any s symbols of w, the remaining n - s symbols have at most L possible completions into a codeword of C. Non-explicitly, there exist binary [MATH HERE] erasure list-...
-
- research-articleMay 2020
CoREC: Scalable and Resilient In-memory Data Staging for In-situ Workflows
ACM Transactions on Parallel Computing (TOPC), Volume 7, Issue 2Article No.: 12, Pages 1–29https://doi.org/10.1145/3391448The dramatic increase in the scale of current and planned high-end HPC systems is leading new challenges, such as the growing costs of data movement and IO, and the reduced mean time between failures (MTBF) of system components. In-situ workflows, i.e., ...
- research-articleNovember 2020
A High-Speed Cauchy CODEC Algorithm for Distributed Storage System
ICICSE '20: Proceedings of the 2020 International Conference on Internet Computing for Science and EngineeringPages 20–24https://doi.org/10.1145/3424311.3424313The erasure codes such as Reed-Solomon (RS) code and Cauchy Reed-Solomon (CRS) code have been widely used in distributed storage system. Though all the erasure codes are able to help recover the storage data successfully when errors happening, the ...
- research-articleJanuary 2020
Data encoding and cost optimised distribution for efficient and secure storage in cloud federation
International Journal of Information and Computer Security (IJICS), Volume 13, Issue 3-4Pages 396–410https://doi.org/10.1504/ijics.2020.109484Cloud federation is the future paradigm of computing which can reduce cost and avoid vendor lock-in problem. Cloud providers are now collaborating for increasing revenue and building trust among customers and indirectly help in better resource utilisation ...
- extended-abstractDecember 2019
Transparent Coded Blockchain
CoNEXT '19 Companion: Proceedings of the 15th International Conference on emerging Networking EXperiments and TechnologiesPages 12–13https://doi.org/10.1145/3360468.3366772This paper proposes transparent blockchain codes to distribute blockchain history. The history data on each node is uncoded (transparent), but entire data obeys the soliton distribution. It not only keeps decentralization, but also brings low bandwidth ...
- research-articleNovember 2019
A digital fountain retrospective
ACM SIGCOMM Computer Communication Review (SIGCOMM-CCR), Volume 49, Issue 5Pages 82–85https://doi.org/10.1145/3371934.3371960We introduced the concept of a digital fountain as a scalable approach to reliable multicast, realized with fast and practical erasure codes, in a paper published in ACM SIGCOMM '98. This invited editorial, on the occasion of the 50th anniversary of the ...
- research-articleOctober 2019
APEC: improved acknowledgement prioritization through erasure coding in bufferless NoCs
NOCS '19: Proceedings of the 13th IEEE/ACM International Symposium on Networks-on-ChipArticle No.: 6, Pages 1–8https://doi.org/10.1145/3313231.3352366Bufferless NoCs have been proposed as they come with a decreased silicon area footprint and a reduced power consumption, when compared to buffered NoCs. However, while known for their inherent simplicity, they suffer from early saturation and depend on ...
- research-articleSeptember 2017
Systematic Erasure Codes with Optimal Repair Bandwidth and Storage
ACM Transactions on Storage (TOS), Volume 13, Issue 3Article No.: 26, Pages 1–27https://doi.org/10.1145/3109479Erasure codes are widely used in distributed storage systems to prevent data loss. Traditional codes suffer from a typical repair-bandwidth problem in which the amount of data required to reconstruct the lost data, referred to as the repair bandwidth, ...
- research-articleJuly 2017
A Layered Architecture for Erasure-Coded Consistent Distributed Storage
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed ComputingPages 63–72https://doi.org/10.1145/3087801.3087832Motivated by emerging applications to the edge computing paradigm, we introduce a two-layer erasure-coded fault-tolerant distributed storage system offering atomic access for read and write operations. In edge computing, clients interact with an edge-...
- research-articleFebruary 2016
Monitoring Bats in the Wild: On Using Erasure Codes for Energy-Efficient Wireless Sensor Networks
- Falko Dressler,
- Margit Mutschlechner,
- Bijun Li,
- R�diger Kapitza,
- Simon Ripperger,
- Christopher Eibel,
- Benedict Herzog,
- Timo Hönig,
- Wolfgang Schröder-Preikschat
ACM Transactions on Sensor Networks (TOSN), Volume 12, Issue 1Article No.: 7, Pages 1–29https://doi.org/10.1145/2875426We explore the advantages of using Erasure Codes (ECs) in a very challenging sensor networking scenario, namely, monitoring and tracking bats in the wild. The mobile bat nodes collect contact information that needs to be transmitted to stationary base ...
- research-articleJanuary 2016
Layered security for storage at the edge: on decentralized multi-factor access control
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and NetworkingArticle No.: 9, Pages 1–10https://doi.org/10.1145/2833312.2833452In this paper we propose a protocol that allows end-users in a decentralized setup (without requiring any trusted third party) to protect data shipped to remote servers using two factors - knowledge (passwords) and possession (a time based one time ...
- research-articleOctober 2015
An Integer Programming-Based Bound for Locally Repairable Codes
IEEE Transactions on Information Theory (ITHR), Volume 61, Issue 10Pages 5280–5294https://doi.org/10.1109/TIT.2015.2472515The locally repairable code (LRC) studied in this paper is an [n, k] linear code of which the value at each coordinate can be recovered by a linear combination of at most r other coordinates. The central problem in this paper is to determine the largest ...
- research-articleApril 2015
Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs
IEEE Transactions on Information Theory (ITHR), Volume 61, Issue 4Pages 1933–1947https://doi.org/10.1109/TIT.2015.2408595A new class of exact-repair regenerating codes is constructed by stitching together shorter erasure correction codes, where the stitching pattern can be viewed as block designs. The proposed codes have the help-by-transfer property where the helper nodes ...
- ArticleDecember 2014
The Auto-configurable LDPC Codes for Distributed Storage
CSE '14: Proceedings of the 2014 IEEE 17th International Conference on Computational Science and EngineeringPages 1332–1338https://doi.org/10.1109/CSE.2014.254The current distributed storage systems mainly rely on data replication to ensure certain level of data availability and reliability. A recent trend is to introduce erasure codes into the distributed storage. Inspired by the RAID system, early attempts ...
- ArticleOctober 2014
Exploiting Decoding Computational Locality to Improve the I/O Performance of an XOR-Coded Storage Cluster under Concurrent Failures
SRDS '14: Proceedings of the 2014 IEEE 33rd International Symposium on Reliable Distributed SystemsPages 125–135https://doi.org/10.1109/SRDS.2014.36In today's large data centers, hundreds to thousands of nodes are deployed as storage clusters to provide cloud and big data storage service, where failures are not rare. Therefore, efficient data redundancy technologies are needed to ensure data ...
- research-articleAugust 2014
A "hitchhiker's" guide to fast and efficient data reconstruction in erasure-coded data centers
SIGCOMM '14: Proceedings of the 2014 ACM conference on SIGCOMMPages 331–342https://doi.org/10.1145/2619239.2626325Erasure codes such as Reed-Solomon (RS) codes are being extensively deployed in data centers since they offer significantly higher reliability than data replication methods at much lower storage overheads. These codes however mandate much higher ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 44 Issue 4