 |
TITLE: Coding Techniques for Distributed Storage
SPEAKER: Alex Dimakis (California Institute of Technology)
DATE: 3:00 - 4:00 PM, Monday, May 18, 2009
LOCATION: Yosemite, 3L
ABSTRACT:
Distributed storage schemes for data centers and peer-to-peer networks
often use erasure coding to introduce redundancy for robustness. We
introduce novel network coding techniques that can surprisingly reduce
the communication required to maintain a storage system compared to
standard Reed-Solomon codes used in current architectures. We present
novel information theoretic performance bounds and explicit network
codes that outperform known storage coding techniques. We show the
connections of the storage repair problem to matroid theory and a
computer search approach to finding optimal storage codes.
BIOGRAPHY:
Alex Dimakis will be joining USC Electrical Engineering department as
an assistant professor after completing a postdoctoral fellowship at
the Center for Mathematics of Information at Caltech. 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.
He received the Eli Jury award in 2008, two outstanding paper awards,
the UC Berkeley Regents Fellowship and the Microsoft Research
Fellowship. His research interests include communications, coding
theory and signal processing, with a current focus on network coding,
message passing algorithms and sparse graph codes.
|
|
|
printable version
