Fundamental Limits of Caching
Location:258 Fitzpatrick Hall of Engineering
Caching is a technique to reduce peak traffic rates by prefetching popular content in memories at the end users. In this talk, we introduce a new formulation of the caching problem focusing on its basic structure. For this setting, we propose a novel coded caching approach that can achieve a significantly larger reduction in peak rate compared to previously known caching schemes. In particular, the improvement can be on the order of the number of end users in the network. Moreover, we argue that the performance of the proposed scheme is within a constant factor from the information-theoretic optimum for all values of the problem parameters (joint work with Mohammad Maddah-Ali).
Bell Labs / Alcatel-Lucent
Urs Niesen received the M.S. degree from the School of Computer and Communication Sciences at the Ecole Polytechnique Federale de Lausanne (EPFL) in 2005 and the Ph.D. degree from the department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT) in 2009. He is currently a member of the technical staff at Bell Labs, Alcatel-Lucent. His research interests are in the areas of communication and information theory.