Fair Congestion Control Protocol for Data Center Bridging
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Data center networking brought a new era of data-intensive applications such as remote direct memory access, high-performance computing, and cloud computing, which raise new challenges for network researchers. Such applications require minimum network latency, no packet loss, and fairness between flows. Therefore, IEEE Data Center Bridging Task Group presents several enhancements for Ethernet networks to fulfill these requirements. In this context, we investigate the possibility of achieving dropless Ethernet. We extend our previously proposed congestion control protocol, named Heterogeneous Flow (HetFlow), to achieve minimum queue length and consequently minimum network latency. In addition, we present a mathematical model, stability analysis, and scalability study of the proposed protocol. Further, extensive simulation experiments are conducted to verify our mathematical analysis. Moreover, it is illustrated by simulations that HetFlow improves fairness between flows of different packet sizes and different round trip times.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it