Network Coding for Distributed Storage: Directions and Open problems
Distributed storage schemes for data centers and peer-to- peer networks often use traditional erasure codes to introduce redundancy for robustness. We will show how network coding can surprisingly reduce the communication required to maintain a storage system compared to standard Reed- Solomon codes used in current architectures. We will present both information theoretic performance bounds and achievable schemes based on novel network codes. Finally, following (very) recent developments, we will show that interference alignment is fundamental for distributed storage problems and demonstrate equivalence to a low-rank matrix completion problem over a finite field. On-going work involves the repair of existing codes used in RAID systems (like EVENODD and B-Code) and the applicability to distributed caching over mobile devices for content sharing.
Speaker Details
Alex Dimakis is an assistant professor at the Viterbi School of Engineering at USC. He has been a faculty member in the Department of Electrical Engineering – Systems since 2009. He received his Ph.D. in 2008 and M.S. degree in 2005 in electrical engineering and computer science, both from the University of California, Berkeley. Prior to that, he obtained the Diploma degree in Electrical and Computer Engineering from the National Technical University of Athens in 2003.
He received the Eli Jury award in 2008 for his thesis work on codes for distributed storage and two outstanding paper awards. He was a postdoctoral scholar at the Center for the Mathematics of Information (CMI) at Caltech in 2008. His research interests include coding theory, signal processing, and networking, with a current focus on distributed storage, network coding, probabilistic inference and message passing algorithms.
- Date:
- Speakers:
- Alex Dimakis
- Affiliation:
- University of Southern California
-
-
Jeff Running
-
