Bibliographic record
Abstract
Congestion control has been a fundamental component with evolving challenges in computer networks during the past few decades. In this thesis, we focus on the following key challenges of congestion control: lack of information sharing among flows, limited congestion visibility at the end-hosts, stringent requirements for convergence time, and dynamic and volatile nature of networks. We design a hierarchical congestion control system (HCC) that addresses the above challenges in data center networks. By grouping flows in a hierarchical manner, HCC enables flow cooperation and information sharing, leading to expanded visibility for flows, improved fairness, and faster convergence. Flows share congestion information within groups and propagate the compressed signals through the hierarchy, enabling aggregate control of multiple flows. HCC implements a distributed system for realizing max-min fairness, which is the theoretical objective of many congestion control protocols. To limit the state space, communication overhead, and processing time, HCC leverages flow aggregation and rate quantization techniques. Rate quantization is an effective way to reduce the run-time of max-min fairness. Flow aggregation helps flows to react collaboratively to changes at the edge of the network and converge to a local optimal state promptly. Also, the aggregated updates are propagated through the hierarchy to reach a globalmax-min fair state. This fast reaction at the edge is beneficial for short-lived flows and on-off traffic patterns. Moreover, to eliminate the volatile nature of flows, we define the correlation-aware flow consolidation problem. In correlation-aware flow consolidation, the goal is to reduce the fluctuations in individual flows by aggregating inversely correlated (or uncorrelated) flows. In our experiments, we show that we can reduce the average standard deviation of group demands by 33% which results in estimating future group demands with higher confidence. We evaluate HCC on a real workload and show that HCC converges to full utilization much faster (up to 4x), with a near zero bottleneck queue size, lower flow completion times (42 − 62%), and a significantly higher fairness index compared to well-known congestion control protocols. Also, by comparing HCC with a centralized solution, we show that HCC significantly reduces the overheads (by 73% and 99.5%).
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".