Aug 2026· Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication· 0 citations· 56 references
Computer Science
TL;DR
HarmGen is presented, a new tool that can efficiently explore a large search space using a genetic algorithm, to find network settings and workloads where there are poor interactions between heterogeneous CCAs.
Abstract
A critical part of new congestion control algorithm (CCA) proposals is an evaluation that a new CCA will reasonably share with already widely-deployed CCAs. However, the methodology for this evaluation is both inconsistent and inefficient due to the complexity of inter-CCA interactions under highly diverse network settings. We address these challenges by developing new metrics for evaluating fairness, developing an algorithm for determining when experiments converge, and applying this methodology to automated evaluation tool Mahak. In addition, we present HarmGen, a new tool that can efficiently explore a large search space using a genetic algorithm, to find network settings and workloads where there are poor interactions between heterogeneous CCAs. We show that with an identical budget of 300 experiments, HarmGen outperforms hill climbing and random search, and finds high harm values similar to a parameter sweep of 3500 experiments. With Mahak and HarmGen, we identify trends in BBR's evolution as well as issues with new L4S deployments.
In this paper, we propose a novel congestion control algorithm (CCA) that can maintain a low and nearly constant buffering delay while ensuring high throughput and high throughput fairness even when the number of flows sharing the same bottleneck link increases significantly. Our proposed CCA uses methods formalized in...
Satoshi Utsumi, S. Zabir, Go Hasegawa· Conference on Applications,...· 0 citations
GenCC, a framework that leverages the code generation capabilities of large language models (LLMs), coupled with a realistic network testbed, to automatically synthesize congestion-control utility functions, demonstrates that LLMs provide a practical and effective approach to automating the design of high-performance c...
Neta Rozen-Schiff, Liron Schiff, Stefan Schmid· Conference on Applications,...· 0 citations
Multi-agent debate (MAD) has emerged as a promising paradigm for improving the reasoning accuracy of large language models (LLMs) through iterative peer interaction. Communication topology plays a central role in this process, motivating increasingly sophisticated mechanisms that learn, adapt, or dynamically reconfigur...
Bo-Xuan Wang, Zhuo-Yun Li, Xiao-Wei Huang et al.· 0 citations
Avoiding network bottlenecks while maximizing network utilization is paramount to supporting modern networked applications. Traditional congestion control protocols like Cubic, BBR, and TCP Vegas have demonstrated efficacy within specific network conditions. However, years of research on transport protocols have shown...
Lorenzo Pappone, Alessio Sacco, Flavio Esposito· IEEE Transactions on Network...· 0 citations
Under the test-time compute scaling paradigm, improving the multi-step reasoning accuracy of lightweight large language models within a limited computational budget remains a critical challenge. Existing self-correction and multi-agent debate methods often suffer from rigid interaction schemes, coarse-grained correctio...
Wenke Li· Applied and Computational En...· 0 citations
Controlling tail risk is an important objective in online optimization, and recently it has been studied in the context of competitive analysis. Continuing this line of research, we investigate pure tail constraints, which capture the tradeoff between expected and worst-case competitiveness. For two fundamental search...
Mateusz Basiak, Marcin Bienkowski, Yong-Ho Shin et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
