5/3/18 | 4:15pm | E51-345
Reception to follow.

R. Srikant

Fredric G. and Elizabeth H. Nearing Endowed Professor of Electrical and Computer Engineering
University of Illinois at Urbana-Champaign 

Abstract: Data center networks interconnect massive server farms used to process big data for a variety of applications. In such networks, resource allocation algorithms are used to distribute computing and network resources, to competing data-processing tasks. The main objective of the algorithms is to ensure very small latencies for delay-critical applications. These algorithms operate at different time scales: at the slow time-scale of jobs, at the intermediate time-scale of flows (communication messages between parallel jobs) and at the fast time-scale of packets. In the first part of the talk, we will present an overview of the architecture of data center networks and the various resource allocation problems that arise in such networks. In the second part of the talk, we will discuss the impact of fair-resource algorithms on the heavy-traffic delay performance of flows in data centers.

Bio:  R. Srikant is the Fredric G. and Elizabeth H. Nearing Endowed Professor in the Department of Electrical and Computer Engineering and a Professor in the Coordinated Science Laboratory at the University of Illinois at Urbana-Champaign. His research interests are in the areas of communication networks, cloud computing, machine learning, and applied probability. He is a recipient of the 2015 IEEE INFOCOM Achievement Award and the 2017 Applied Probability Society Best Publication Award. He was the Editor-in-Chief of the IEEE/ACM Transactions on Networking from 2013-2017.