BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The Battle for Bandwidth: Fairness and Heterogenous Congestion Con
 trol on Today's Internet - Justine Sherry\, CMU
DTSTART:20201029T150000Z
DTEND:20201029T160000Z
UID:TALK152221@talks.cam.ac.uk
CONTACT:Srinivasan Keshav
DESCRIPTION:In recent years\, the Internet has seen an explosion of innova
 tion in the congestion control space.\nWhere the Internet was previously d
 ominated by a few well-studied algorithms (namely Reno-derivants and Cubic
 )\, today's services may use one of a wide range of algorithms such as Cop
 a\, BBR\, LEDBAT\, GCC\, etc.\nWe often evaluate new algorithms from the p
 erspective of the services that use the new CCA\, e.g.\, looking at perfor
 mance outcomes in terms of latency\, flow completion times\, or video rebu
 ffering rates.\nHowever\, less attention has focused on how these algorith
 ms compete with each other when sharing a bottleneck link and whether or n
 ot new algorithms cause performance degradation for legacy services runnin
 g side-by-side along the new algorithm.\n\nIn this talk\, I will present a
  case study of a widely deployed algorithm -- BBRv1 -- and how it behaves 
 under competition with legacy algorithms.\nOur study of BBRv1 combines mea
 surements and mathematical models to demonstrate that BBRv1's bandwidth co
 nsumption is independent of the number of competing Reno or Cubic flows an
 d is therefore fundamentally unfair to these existing algorithms\; our res
 ults informed Google in the redesign of BBRv1\, resulting in BBRv2.\nI wil
 l then explore a new methodology for deciding whether or not a new algorit
 hm is acceptable for deployment on the Internet. Where the traditional lit
 erature has focused on fairness\, we re-frame the discussion in terms of a
  concept called harm that we argue is more practical to serve as a standar
 d or "bar" for what is acceptable to deploy.\nOur work on harm was awarded
  the IRTF Applied Networking Research Prize in 2019.\nFinally\, I will pre
 sent our new testbed for measuring the harm that Internet services inflict
  upon each other and some preliminary results from our testbed evaluating 
 the harm caused by video services such as Netflix\, Vimeo\, and YouTube.\n
 \nBio: Justine Sherry is an assistant professor at Carnegie Mellon Univers
 ity. Her interests are in software and hardware networked systems\; her wo
 rk includes middleboxes\, FPGA packet processing\, measurement\, cloud com
 puting\, and congestion control. Dr. Sherry received her PhD (2016) and MS
  (2012) from UC Berkeley\, and her BS and BA (2010) from the University of
  Washington. Her research has been awarded the Applied Networking Research
  Prize\, the SIGCOMM doctoral dissertation award\, the David J. Sakrison p
 rize\, paper awards at USENIX NSDI and ACM SIGCOMM\, and an NSF Graduate R
 esearch Fellowship. She is a member of the DARPA ISAT Study Group and the 
 SIGCOMM CARES Committee. Most importantly\, she is always on the lookout f
 or a  great cappuccino.\n
LOCATION:https://meet.google.com/ehj-dwaz-rea
END:VEVENT
END:VCALENDAR
