BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Treeplication: An Erasure Code for Distributed Full Recovery in St
 orage Systems
DTSTART:20200228T141500
DTEND:20200228T151500
DTSTAMP:20260428T115322Z
UID:d26232ccff21d1df3c66d08bf522a7e7b89c64d10fd2c60e275ae4ee
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Yuval Cassuto\, Technion\nIn this talk we present a new 
 (rateless) erasure code called Treeplication\, which features the benefits
  of both coding and replication. From the system's perspective\, Treeplica
 tion allows recovering large distributed data items with better probabilit
 y than replication\, and with lower communication cost than known erasure 
 codes. From the coding perspective\, a Treeplication code for k data fragm
 ents is defined on a binary tree with 2k-1 vertices\, along with a distrib
 ution for selecting code fragments from the tree layers. The tree structur
 e allows to optimize the recoverability of random subsets of code fragment
 s\, while at the same time behaving similarly to replication in recovering
  individual data fragments (in particular\, most code symbols in the optim
 al distributions turn out to be systematic information symbols). In additi
 on to optimizing Treeplication for recoverability\, our results include an
 alysis of their recovery communication cost\, dynamic optimization of thei
 r redundancy\, and an algorithm for decentralized maintenance of a Treepli
 cation-coded system.
LOCATION:INM 202 https://plan.epfl.ch/?room==INM%20202
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR