Visiting Lecture: Coded Caching and Backhaul Coordination by Babak H. Khalaj

Wednesday, March 15, 2017

Time: 9-10

Venue: TS 101

Coded Caching and Backhaul Coordination



In this talk, we will first provide a brief overview of research activities in our group. Then, we review the concept of coded caching from an information theoretic perspective where we focus on multiple-server wired networks with multiple users receive contents from multiple servers, simultaneously. We show that considering network topology will reduce the content delivery delay. Then, we consider a wireless network and analyze the effect of imperfect Channel State Information at the Transmitter (CSIT) on the system Degrees of Freedom (DoF). Moreover, we derive finite SNR rate expressions, which shows that adapting the original coded caching ideas to finite SNR wireless scenarios needs careful modifications of the scheme. The results of delay analysis is Single Bottleneck Cache networks based on Queueing theory analysis will also be presented. Finally, in the area of backhaul coordination among base stations, new models for bounding the amount of information exchange at the backhaul will be discussed.


Short Bio

Babak H. Khalaj received the B.Sc. degree from Sharif University of Technology, Tehran, Iran, and the M.Sc. and Ph.D. degrees from Stanford University all in Electrical Engineering, in 1989, 1993, and 1996, respectively. At Stanford, he has been among the pioneering team working on adoption of Multi-Antenna arrays in mobile networks. From 1996 to 1999, he has been working at startup companies in Silicon Valley. Since then, he joined Sharif University of Technology as a faculty and has also been a Visiting Professor at CEIT, San Sebastian, Spain, from 2006 to 2007 and the recipient of Alexander von Humboldt Fellowship in 2007–2008. His main research area is currently analysis of complex networks in terms of computation, communication, distributed storage and virtualization.


Link to CV


Add to calendar

Back to events

Last updated: 3.3.2017