Kathrin Elmenhorst
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Kathrin Elmenhorst has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Nils Aschenbruck
Osnabrück University, Osnabrück, Germany
3 shared publications - Constantin Sander
RWTH Aachen University, Aachen, Germany
1 shared publication - Eric Lanfer
Osnabrück University, Osnabrück, Germany
1 shared publication - Ike Kunze
RWTH Aachen University
1 shared publication - Klaus Wehrle
Communication and Distributed Systems, RWTH Aachen University, Aachen, Germany
1 shared publication - Malte Wehmeier
Institute of Computer Science, Osnabrück University, Osnabrück Germany
1 shared publication
Latest Publications
- Open Access
- 2 September 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 4 (CoNEXT3) , 1-21
2BRobust - Mitigating TCP BBR Performance Degradation in Virtual Machines under CPU Contention
Motivated by the recent introduction and large-scale deployment of BBR congestion control algorithms, multiple studies have investigated the performance and fairness implications of this shift from loss-based to delay-based congestion control. Given the potential Internet-wide adoption of BBR, we must also consider its robustness in network and system scenarios. One such scenario is Cloud-based Virtual Machine (VM) networking - highly relevant in today's CDN-centric Internet. Interestingly, previous work has shown significant performance problems of BBRv1 running in Xen VMs, with BBR performance dropping to almost zero when CPU credit is low. In this paper, we develop a framework for measuring TCP throughput under fully controlled CPU contention, which uses Linux deadline scheduling to emulate generalized CPU contention conditions. Our measurements reveal that - in stark contrast to Cubic! - BBR throughput can break down during CPU contention under any hypervisor and all tested BDP conditions. Characterizing this performance degradation on a fine-granular level, we show that CPU-limited BBR senders are capped at very low throughput levels below 10-20 Mbps. This finding implies that an Internet-wide shift from Cubic to BBR could harm the Internet's overall robustness, if not deployed with caution. To detect and overcome CPU-limited throughput, we propose a BBR patch which detects the problematic situation by monitoring inflight bytes and reacts by increasing the pacing rate to make better use of the available CPU time. We show that our BBR patch mitigates the throughput problem for the most critical cases.
- 2 September 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 4 (CoNEXT3) , 1-21
Open Access2BRobust - Mitigating TCP BBR Performance Degradation in Virtual Machines under CPU Contention
Motivated by the recent introduction and large-scale deployment of BBR congestion control algorithms, multiple studies have investigated the performance and fairness implications of this shift from loss-based to delay-based congestion control. Given the potential Internet-wide adoption of BBR, we must also consider its robustness in network and system scenarios. One such scenario is Cloud-based Virtual Machine (VM) networking - highly relevant in today's CDN-centric Internet. Interestingly, previous work has shown significant performance problems of BBRv1 running in Xen VMs, with BBR performance dropping to almost zero when CPU credit is low. In this paper, we develop a framework for measuring TCP throughput under fully controlled CPU contention, which uses Linux deadline scheduling to emulate generalized CPU contention conditions. Our measurements reveal that - in stark contrast to Cubic! - BBR throughput can break down during CPU contention under any hypervisor and all tested BDP conditions. Characterizing this performance degradation on a fine-granular level, we show that CPU-limited BBR senders are capped at very low throughput levels below 10-20 Mbps. This finding implies that an Internet-wide shift from Cubic to BBR could harm the Internet's overall robustness, if not deployed with caution. To detect and overcome CPU-limited throughput, we propose a BBR patch which detects the problematic situation by monitoring inflight bytes and reacts by increasing the pacing rate to make better use of the available CPU time. We show that our BBR patch mitigates the throughput problem for the most critical cases.
- Open Access
- 4 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 130-140
Camera-Ready? Exploring Transport-Layer Performance Limits with GigE Vision
- 4 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 130-140
Open AccessCamera-Ready? Exploring Transport-Layer Performance Limits with GigE Vision
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 127-129
Clouded Comparisons - On the Impact of Virtual Machines on TCP-BBR Performance
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 127-129
Open AccessClouded Comparisons - On the Impact of Virtual Machines on TCP-BBR Performance
- Open Access
- 22 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 85-91
Cascades of Nested Acknowledgments in Multi-Hop MASQUE
- 22 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 85-91
Open AccessCascades of Nested Acknowledgments in Multi-Hop MASQUE