| Lecturer Profile |
Kenneth W. Shum received his B.Eng degree in information engineering from The Chinese University of Hong Kong in 1993, and MSc and PhD degrees in electrical engineering from University of Southern California in 1995 and 2000, respectively. He is now a Research Associate Professor with Institute of Network Coding in The Chinese University of Hong Kong. His research interests include coding for distributed storage systems and sequence design. |
| Lecture Abstract |
Distributed storage system is a crucial component in today’s cloud computing enterprise. Reliability is provided by distributing data to storage devices in different locations, such that if a hard disk is not available, the data can be downloaded elsewhere. As the storage devices are connected via a network, a failed hard disk is repaired by downloading data from other hard disks. The incurred network traffic for the purpose of repair is not negligible as the total number of storage nodes increases. How to reduce the amount of repair traffic becomes an important issue for distributed storage systems. Regenerating codes is a class of erasure-correcting codes which is designed for the minimization of repair traffic. In this talk, we discuss a fundamental bound on repair traffic found by Dimakis et al. and some optimal regenerating codes which attain this bound. |
