Speaker: Radhika Mittal, University of California, Berkeley
Location: 60 Fifth Avenue 150
Date: February 26, 2018, 2 p.m.
Host: Jinyang Li
There have been many recent proposals to change the network infrastructure in order to meet different performance objectives. These changes are often difficult to deploy, either requiring specialized network switching hardware or greatly complicating network management. Rather than continuing to add new features to the network in an ad-hoc manner, my work advocates a principled approach for meeting different performance objectives, that leads to a more stable network infrastructure. This approach is based on the following two questions: First, can we avoid making changes to the network infrastructure by looking for solutions that only change the end-points? Second, when infrastructure changes are needed, can we make them universal in nature? In this talk, I will primarily focus on the second question, where I explore whether we can have a universal packet scheduling algorithm, that can mimic all other scheduling algorithms. Towards the end, I will briefly present three examples in the context of wide-area and datacenter congestion control, where I tackle the first question of avoiding changes to the network infrastructure.
Radhika Mittal is a Phd candidate in the Computer Science Department at UC Berkeley, where she is advised by Prof. Sylvia Ratnasamy and Prof. Scott Shenker. Her work has covered several topics in computer systems and networking. Before starting at UC Berkeley in 2012, she received her bachelor degree in Computer Science and Engineering from IIT Kharagpur in India.
Refreshments will be offered starting 15 minutes prior to the scheduled start of the talk.