<html><head><meta http-equiv="Content-Type" content="text/html charset=us-ascii"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space;" class=""><div class=""><span class="" style="font-size: 14px; orphans: 2; widows: 2;">UNIVERSITY OF CHICAGO</span><br class="" style="font-size: 14px; orphans: 2; widows: 2;"><span class="" style="font-size: 14px; orphans: 2; widows: 2;">DEPARTMENT OF COMPUTER SCIENCE</span></div><div class="" style="orphans: 2; widows: 2;"><span class="" style="font-size: 14px;">PRESENTS</span></div><div class="" style="orphans: 2; widows: 2;"><span class="" style="font-size: 14px;"><br class=""></span></div><div class="" style="orphans: 2; widows: 2;"><div class="" style="margin: 0px; line-height: normal;"><img apple-inline="yes" id="C27CD55F-0207-4128-A91C-8653C8FA19FB" height="136" width="109" apple-width="yes" apple-height="yes" src="cid:5E4B75AF-BA14-4015-A418-706879D47372@cs.uchicago.edu" class=""></div></div><div class="" style="orphans: 2; widows: 2;"><br class=""></div><div class="" style="orphans: 2; widows: 2;"><div class="" style="margin: 0in 0in 0.0001pt;"><b class="" style="font-size: 14px;">Radhika Mittal</b></div><div class="" style="margin: 0in 0in 0.0001pt;"><span class=""><span class="" style="font-size: 14px;"><b class="">University of California, Berkeley</b></span></span></div><div class="" style="margin: 0in 0in 0.0001pt;"><br class=""></div><div class="" style="margin: 0in 0in 0.0001pt;"><b class=""><font class="" style="font-size: 14px;"><br class=""></font></b></div><div class="" style="margin: 0in 0in 0.0001pt;"><span class="" style="font-size: 14px;"><b class=""><font class="">Thursday, February 22, 2018 at 3:30 pm <br class="">Ryerson 251</font></b><br class=""></span></div></div><div class="" style="orphans: 2; widows: 2;"><span class="" style="font-size: 14px;"><br class=""></span></div><div class=""><br class=""></div><div class=""><div class=""><b class="" style="color: rgb(33, 33, 33); font-family: Roboto, Helvetica, Arial, sans-serif; font-size: 14px;">Title: T</b><font color="#212121" face="Roboto, Helvetica, Arial, sans-serif" class=""><span class="" style="font-size: 14px;">owards a More Stable Network Infrastructure</span></font></div><div class="" style="color: rgb(33, 33, 33); font-family: Roboto, Helvetica, Arial, sans-serif; font-size: 14px;"><b class=""><br class=""></b></div><div class="" style="color: rgb(33, 33, 33); font-family: Roboto, Helvetica, Arial, sans-serif; font-size: 14px;"><b class="">Abstract:</b></div><div class=""><font color="#212121" face="Roboto, Helvetica, Arial, sans-serif" class=""><span class="" style="font-size: 14px;">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, in this talk, I will present 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? I will begin with and mainly 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.<br class=""></span><br class=""><span class="" style="font-size: 14px; background-color: rgb(255, 255, 255);"> </span><br class=""></font><b class="" style="color: rgb(33, 33, 33); font-family: Roboto, Helvetica, Arial, sans-serif; font-size: 14px;">Bio:</b></div><div class=""><span id="docs-internal-guid-8bdccc40-716c-e22d-6a5f-d3d1c5863489" class=""><div class="" style="line-height: 1.38; margin-top: 0pt; margin-bottom: 0pt;"><font color="#212529" class=""><span class="" style="font-size: 14px; white-space: pre-wrap;"><i class="">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. </i></span></font></div><div class=""><span class="" style="font-size: 10pt; font-family: Arial; color: rgb(33, 37, 41); background-color: rgb(255, 255, 255); font-variant-ligatures: normal; font-variant-position: normal; font-variant-numeric: normal; font-variant-alternates: normal; font-variant-east-asian: normal; vertical-align: baseline; white-space: pre-wrap;"><br class=""></span></div></span></div><div class=""><div class="" style="color: rgb(33, 33, 33); font-family: Roboto, Helvetica, Arial, sans-serif; font-size: 14px;"><b class="">Host: Ben Zhao</b></div><div class="" style="color: rgb(33, 33, 33); font-family: Roboto, Helvetica, Arial, sans-serif; font-size: 14px;"><b class=""><br class=""></b></div><div class="" style="color: rgb(33, 33, 33); font-family: Roboto, Helvetica, Arial, sans-serif; font-size: 14px;"><b class=""><br class=""></b></div><div class="" style="color: rgb(33, 33, 33); font-family: Roboto, Helvetica, Arial, sans-serif;"><b class=""><i class="">Link to PDF:</i> </b><a href="https://www.cs.uchicago.edu/sites/cs/files/uploads/seminar_announcements/Mittal poster.pdf" class="">https://www.cs.uchicago.edu/sites/cs/files/uploads/seminar_announcements/Mittal%20poster.pdf</a></div></div></div></body></html>