1 / 17

Compound Codes for Optimal Repair in Distributed Storage

Compound Codes for Optimal Repair in Distributed Storage. Viveck R. Cadambe. Data Centers. Servers (RAID-type systems). Peer-to-Peer Storage. Distributed Storage. Data Centers. Servers (RAID-type systems). Peer-to-Peer Storage. Redundancy for a fixed amount storage

Télécharger la présentation

Compound Codes for Optimal Repair in Distributed Storage

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Compound Codes for Optimal Repair in Distributed Storage Viveck R. Cadambe

  2. Data Centers Servers (RAID-type systems) Peer-to-Peer Storage

  3. Distributed Storage Data Centers Servers (RAID-type systems) Peer-to-Peer Storage

  4. Redundancyfor a fixed amount storage • Maximum Distance Separable Codes (MDS Codes); For example,Reed-Solomon Codes • Complexity (Encoding and Update) • EVENODD, STAR, RDP, Liberation, X Codes etc. • (Recent) Repair Efficiency • Network bandwidth • Disk access

  5. Redundancyfor a fixed amount storage • Maximum Distance Separable Codes (MDS Codes); For example,Reed-Solomon Codes • Complexity (Encoding and Update) • EVENODD, STAR, RDP, Liberation, X Codes etc. • (Recent) Repair Efficiency • Network bandwidth • Disk access

  6. Redundancyfor a fixed amount storage • Maximum Distance Separable Codes (MDS Codes); For example,Reed-Solomon Codes • Complexity (Encoding and Update) • EVENODD, STAR, RDP, Liberation, X Codes etc. • (Recent) Repair Efficiency • Network bandwidth • Disk access

  7. Redundancyfor a fixed amount storage • Maximum Distance Separable Codes (MDS Codes); For example, Reed Solomon Codes • Complexity(Encoding and Update) • EVENODD, STAR, RDP, Liberation, X Codes etc. • (Recent) Repair Efficiency • Network bandwidth • Disk access

  8. Practical reasons (Reliability, Network Bandwidth usage) *non-multicast -> Destinations do not intend to decode all the sources in the network.

  9. Practical reasons (Reliability, Network Bandwidth usage) • Multi-Source (non-multicast*) Network Capacity Problem • Interference Alignment *non-multicast -> Destinations do not intend to decode all the sources in the network.

  10. [Wu-Dimakis 09] Trivial Repair : 4 linear combinations

  11. [Wu-Dimakis 09] Interference Alignment!

  12. Interference Alignment!

More Related