 |
TITLE: DRESS Code For The Storage Cloud
SPEAKER: Salim El Rouayheb (UC Berkeley)
DATE: 2:00 - 3:00 PM, Wednesday, March 2, 2011
LOCATION: Yosemite, 3L
ABSTRACT:
"Fifteen young ladies in a school walk out three abreast for seven
days in succession; it is required to arrange them daily, so that no
two will walk twice abreast." Thomas Kirkman posed this problem in
1850 in The Lady's and Gentleman's Diary thereby starting the area of
combinatorial design theory. In this talk, I will show how solving
Kirkman's schoolgirls problem, and other problems that are alike, is
at the heart of constructing low-latency and bandwidth-efficient codes
for distributed cloud storage. We call these codes Distributed
REplication-based Simple Storage (DRESS) codes.
DRESS codes have linear decoding complexity and permit fast 'uncoded'
repair from failures with minimum bandwidth and Disk I/O overhead. The
design of optimal DRESS codes translates into interesting
combinatorial problems with many open questions. We present optimal
code constructions based on projective planes and Steiner systems. We
also propose randomized constructions for scalable DRESS codes using a
bins-and-balls approach. When the security in the cloud is breached
and some nodes start acting maliciously, our codes do not only
guarantee data integrity, but also help catch the bad guys.
Joint work with Sameer Pawar, Nima Noorshams, and Kannan Ramchandran.
BIOGRAPHY:
Salim El Rouayheb is a postdoctoral research fellow with the
Electrical Engineering and Computer Sciences (EECS) Department,
University of California, Berkeley. His research interests lie in the
broad area of communications with a focus on reliable and secure
distributed information systems and on the algorithmic and
information-theoretic aspects of networking.
He received the Diploma degree in electrical engineering from the
Lebanese University, Roumieh, Lebanon, in 2002, and the M.S. degree in
computer and communications engineering from the American University
of Beirut, Lebanon, in 2004. He received the Ph.D. degree in
electrical engineering from Texas As&M University, College Station, in
2009. During summer 2006, he was an intern at the Mathematics of
Communication Research Department at Bell Labs. He received the
Charlie S. Korban award for outstanding graduate student, and the
Texas Telecommunication Engineering Consortium (TXTEC) Graduate
Fellowship.
|
|
|
printable version
