Computer Science Thesis Proposal

— 2:30pm

Location:
In Person and Virtual - ET - Reddy Conference Room, Gates Hillman 4405 and Zoom

Speaker:
RANYSHA WARE , Ph.D. Student, Computer Science Department, Carnegie Mellon University
https://www.cs.cmu.edu/~rware/

Battle for Bandwidth: On The Deployability of New Congestion Control Algorithms

The Internet has become the central source of information and communication in modern society.  Congestion control algorithms (CCAs) are critical for the stability of the Internet: ensuring that users are able to fairly and efficiently share the network. Over the past 30 years, researchers and Internet content providers have proposed and deployed dozens of new CCAs designed to keep up with the growing demands of faster networks, diverse applications, and mobile users. Without tools to understand this growing heterogeneity in CCAs deployed in the Internet, the fairness of the Internet is at stake. 

Towards understanding this growing heterogeneity, we develop CCAnalyzer, a tool to determine what CCA a particular web service deploys, outperforming previous classifiers in accuracy and efficiency.  With CCAnalyzer, we show that new CCAs, both known and unknown, have widespread deployment in the Internet today, including a recently proposed CCA by Google: BBRv1. Next, we develop the first model of BBRv1, and prove BBRv1 can be very unfair to legacy loss-based CCAs, an alarming finding given the prolific deployment of BBRv1.

Consequently, we argue the need for a better methodology for determining if a new CCA is safe to deploy in the Internet today. We describe how the typical methodology testing for equal-rate fairness (every user gets the same bandwidth) is both an unachievable goal and ultimately, not the right threshold for determining if a new CCA is safe to deploy alongside others. Instead of equal-rate fairness, we propose a new metric we call, harm, and argue for a harm-based threshold.

Lastly, in this thesis proposal, we propose future work on how to, in an automated way, generate realistic scenarios where CCA interactions have high harm to ease the evaluation of new CCAs. Our work takes critical steps towards ensuring a fair Internet in a world of heterogeneous congestion control. 

Thesis Committee:

Srinivasan Seshan (Co-Chair)
Justine Sherry (Co-Chair)
Theo Benson
Jim Kurose (University of Massachusetts, Amherst)

In Person and Zoom Participation.  See announcement.

Add event to Google
Add event to iCal