Adithya Abraham Philip
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Adithya Abraham Philip has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Justine Sherry
Carnegie Mellon University, Pittsburgh, USA
3 shared publications - Alexis Schlomer
Carnegie Mellon University, Pittsburgh, USA
2 shared publications - Ranysha Ware
Swarthmore College, Swarthmore, PA, USA
2 shared publications - Srinivasan Seshan
Carnegie Mellon University, Pittsburgh, USA
2 shared publications - Zili Meng
Hong Kong University of Science and Technology, Hong Kong, China
2 shared publications - Fabian Francis Mkocheko
University of Massachusetts Amherst, Amherst, USA
1 shared publication
Latest Publications
- Open Access
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 54-56
POSTER: User-Controllable Congestion Mitigation for Low-Latency Applications
Since the beginning of the decade, real-time communication (RTC) protocols, including video conferencing applications, cloud gaming, and VR/AR streaming, have rapidly expanded over the Internet. With the eventual arrival of the metaverse, RTC traffic is widely anticipated to become the predominant type of Internet traffic in the near future [4, 9].
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 54-56
Open AccessPOSTER: User-Controllable Congestion Mitigation for Low-Latency Applications
Since the beginning of the decade, real-time communication (RTC) protocols, including video conferencing applications, cloud gaming, and VR/AR streaming, have rapidly expanded over the Internet. With the eventual arrival of the metaverse, RTC traffic is widely anticipated to become the predominant type of Internet traffic in the near future [4, 9].
- Open Access
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 181-196
CCAnalyzer: An Efficient and Nearly-Passive Congestion Control Classifier
We present CCAnalyzer, a novel classifier for deployed Internet congestion control algorithms (CCAs) which is more accurate, more generalizable, and more human-interpretable than prior classifiers. CCAnalyzer requires no knowledge of the underlying CCA algorithms, and it can identify when a CCA is novel - i.e. not in the training set. Furthermore, CCAnalyzer can cluster together servers it believes use the same novel/unknown algorithm. CCAnalyzer correctly identifies all 15 of the default Internet CCAs deployed with Linux, including BBRv1, which no existing classifier can do. Finally, CCAnalyzer can classify server CCAs while being as efficient or better than prior approaches in terms of bytes transferred and runtime. We conduct a measurement study using CCAnalyzer measuring the CCA for 5000+ websites. We find widespread deployment of BBRv1 at large CDNs, and demonstrate how our clustering technique can detect deployments of new algorithms as it discovers BBRv3 although BBRv3 is not in its training set.
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 181-196
Open AccessCCAnalyzer: An Efficient and Nearly-Passive Congestion Control Classifier
We present CCAnalyzer, a novel classifier for deployed Internet congestion control algorithms (CCAs) which is more accurate, more generalizable, and more human-interpretable than prior classifiers. CCAnalyzer requires no knowledge of the underlying CCA algorithms, and it can identify when a CCA is novel - i.e. not in the training set. Furthermore, CCAnalyzer can cluster together servers it believes use the same novel/unknown algorithm. CCAnalyzer correctly identifies all 15 of the default Internet CCAs deployed with Linux, including BBRv1, which no existing classifier can do. Finally, CCAnalyzer can classify server CCAs while being as efficient or better than prior approaches in terms of bytes transferred and runtime. We conduct a measurement study using CCAnalyzer measuring the CCA for 5000+ websites. We find widespread deployment of BBRv1 at large CDNs, and demonstrate how our clustering technique can detect deployments of new algorithms as it discovers BBRv3 although BBRv3 is not in its training set.
- Open Access
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 506-520
Prudentia: Findings of an Internet Fairness Watchdog
With the rise of heterogeneous congestion control algorithms and increasingly complex application control loops (e.g. adaptive bitrate algorithms), 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 bottlenecks. In this paper, we provide the first study of fairness between live, end-to-end services with distinct workloads. Rather than focusing on individual components of an application stack (e.g., studying the fairness of an individual congestion control algorithm), we want to provide a direct study over real-world deployed applications. 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.
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 506-520
Open AccessPrudentia: Findings of an Internet Fairness Watchdog
With the rise of heterogeneous congestion control algorithms and increasingly complex application control loops (e.g. adaptive bitrate algorithms), 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 bottlenecks. In this paper, we provide the first study of fairness between live, end-to-end services with distinct workloads. Rather than focusing on individual components of an application stack (e.g., studying the fairness of an individual congestion control algorithm), we want to provide a direct study over real-world deployed applications. 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.