Prudentia: Findings of an Internet Fairness Watchdog
Abstract: Almost all traffic on the Internet today is sent by Congestion Control Algorithms, which aim to maximize utilization of available bandwidth on an Internet link while simultaneously sharing this bandwidth equally with competing traffic. With the rise of heterogeneous congestion control algorithms and increasingly complex application control loops (e.g. adaptive bitrate algorithms found in video streaming), the Internet community has expressed growing concern that network bandwidth allocations are unfairly skewed, and that some Internet services are ‘winners’ at the expense of ‘losing’ services when competing over shared bottleneck links. In this paper, we provide the first study of fairness between live, end-to-end services with distinct workloads. Put simply, if you and your roommate are watching Netflix and YouTube on a bandwidth-constrained Internet link, would you end up streaming your video at the lowest resolution while your roommate enjoys a high quality 4K stream, or would the outcome be fairer? Among our findings, we observe that services typically achieve less-than-fair outcomes: on average, the ‘losing’ service achieves only 72% of its max-min fair share of link bandwidth. We also find that some services are significantly more contentious than others: for example, one popular file distribution service causes competing applications to obtain as low as 16% of their max-min fair share of bandwidth when competing in a moderately-constrained setting.
Date and Time
Location
Hosts
Registration
- Date: 12 Feb 2025
- Time: 06:30 PM to 08:00 PM
- All times are (UTC-05:00) Eastern Time (US & Canada)
-
Add Event to Calendar
- 135 N. Bellefield
- Pittsburgh, Pennsylvania
- United States
- Building: 3rd floor theater space
- Room Number: Room 316
- Starts 22 January 2025 12:00 AM
- Ends 12 February 2025 12:00 AM
- All times are (UTC-05:00) Eastern Time (US & Canada)
- No Admission Charge
Speakers
Adithya
Biography:
Bio: Adithya Abraham Philip is a sixth-year CSD Ph.D. student at Carnegie Mellon University, advised by Prof. Justine Sherry. His research interests lie in computer networking, with a focus on Congestion Control Algorithms (CCAs) and their increasingly complex interactions. His current research investigates the fairness properties of CCAs in various settings and deployments, so we can make informed decisions on what CCAs we should be using and where. In his spare time, he dabbles in archery and fixes holes in his drywall, events which he promises are completely unrelated.