170 likes | 282 Views
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
E N D
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
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
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
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
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
Practical reasons (Reliability, Network Bandwidth usage) *non-multicast -> Destinations do not intend to decode all the sources in the network.
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.
[Wu-Dimakis 09] Trivial Repair : 4 linear combinations
[Wu-Dimakis 09] Interference Alignment!