Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Babel Storage: Uncoordinated Content Delivery from Multiple Coded Storage Systems

Babel Storage: Uncoordinated Content Delivery from Multiple Coded Storage Systems

Thumbnail Image
Download
Name

1908.09271.pdf

Description
Submitted version
Size

525.39 KB

Format

Adobe PDF

Checksum (MD5)

f6ea1dfd98d4eefef19fd6fedc11251f

sword-2021-02-08T14:49:36.original.xml (130 B)
Original SWORD entry document
Author(s)
Neu, Joachim
•
Medard, Muriel
Date Issued
February 2020
Journal
2019 IEEE Global Communications Conference (GLOBECOM)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Neu, Joachim and Muriel Medard. "Babel Storage: Uncoordinated Content Delivery from Multiple Coded Storage Systems." 2019 IEEE Global Communications Conference (GLOBECOM), December 2019, Waikoloa, Hawaii, February 2020. © 2019 IEEE
Version
Original manuscript
Abstract
In future content-centric networks, content is identified independently of its location. From an end-user's perspective, individual storage systems dissolve into a seemingly omnipresent structureless 'storage fog'. Content should be delivered oblivious of the network topology, using multiple storage systems simultaneously, and at minimal coordination overhead. Prior works have addressed the advantages of error correction coding for distributed storage and content delivery separately. This work takes a comprehensive approach to highlighting the tradeoff between storage overhead and transmission overhead in uncoordinated content delivery from multiple coded storage systems. Our contribution is twofold. First, we characterize the tradeoff between storage and transmission overhead when all participating storage systems employ the same code. Second, we show that the resulting stark inefficiencies can be avoided when storage systems use diverse codes. What is more, such code diversity is not just technically desirable, but presumably will be the reality in the increasingly heterogeneous networks of the future. To this end, we show that a mix of Reed-Solomon, low-density parity-check and random linear network codes achieves close-to-optimal performance at minimal coordination and operational overhead.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/129755
DOI of Published Version
https://doi.org/10.1109/GLOBECOM38437.2019.9013383
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.