On some data processing problems arising in the distributed storage systems
Vortrag von Dr. Vitaly Skachek
Sprecher eingeladen von: Prof. Dr. Joachim Rosenthal
Datum: 27.10.14 Zeit: 13.00 - 14.00 Raum: Y27H35/36
In this talk, we survey some new challenges in the area of coding theory, posed by the recent developments in the distributed storage systems.In the first part of the talk, we present locally repairable (LR) codes and discuss their parameters. We survey known constructions and present bounds on the parameters of such codes. Finally, we show a link between the LR codes and batch codes.
In the second part of the talk, we consider the problem of data reconciliation. We show that two vector subspaces can be easily synchronized by an efficient algorithm. By building on this observation, we propose an algorithm for synchronization of two collections of binary files, stored in the cloud in a distributed manner. By further employing techniques akin to network coding, we propose a more efficient file synchronization algorithm.
Parts of this talk are joint works with Helger Lipmaa and with Michael Rabbat.