Pith. Sign in

RECORD

FairQ: Fair and Fast Rate Allocation in Data Centers

Networking and Internet Architecture · Submitted 9 Jan 2024

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim The experimental results from real deployments in a small testbed cluster show the effectiveness of our approach.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2401.04850 (version 1)
Pith IDE24WQ7ZW, Pith's permanent record of this paper and its review
CitationAhmed M. Abdelmoniem, Brahim Bensaou. "FairQ: Fair and Fast Rate Allocation in Data Centers." arXiv:2401.04850 (2024). https://pith.science/paper/E24WQ7ZW
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,239 input tokens.

What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.34 · human participants 0.03 · controlled comparison 0.08 · randomized assignment 0.01 · states quantitative result 0.05 · compares with prior results 0.10 · mentions code or data availability 0.04.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

The peculiar congestion patterns in data centers are caused by the bursty and composite nature of traffic, the small bandwidth-delay product, and the tiny switch buffers. It is not practical to modify TCP to adapt to data centers, especially in public clouds where multiple congestion control protocols coexist. In this work, we design a switch-based method to address such congestion issues; our approach does not require any modification to TCP, which enables easy and seamless deployment in public data centers via switch software update. We first present a simple analysis to demonstrate the stability and effectiveness of the scheme, and then we discuss a hardware NetFPGA switch-based prototype. The experimental results from real deployments in a small testbed cluster show the effectiveness of our approach.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 The peculiar congestion patterns in data centers are caused by the bursty and composite nature of traffic, the small bandwidth-delay product, and the tiny switch buffers. background 1.00 0.18 0.03 asserted 1.00
s1 It is not practical to modify TCP to adapt to data centers, especially in public clouds where multiple congestion control protocols coexist. background 0.89 0.14 0.04 asserted 1.00
s2 In this work, we design a switch-based method to address such congestion issues; our approach does not require any modification to TCP, which enables easy and seamless deployment in public data centers via switch software update. contribution 0.91 0.92 0.47 asserted 0.99
s3 We first present a simple analysis to demonstrate the stability and effectiveness of the scheme, and then we discuss a hardware NetFPGA switch-based prototype. method 0.51 0.93 0.07 asserted 0.85
s4 The experimental results from real deployments in a small testbed cluster show the effectiveness of our approach. result 0.99 0.95 0.46 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from observation or experiment 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

The peculiar congestion patterns in data centers are caused by the bursty and composite nature of traffic, the small bandwidth-delay product, and the tiny switch buffers. It is not practical to modify TCP to adapt to data centers, especially in public clouds where multiple congestion control protocols coexist. In this work, we design a switch-based method to address such congestion issues; our approach does not require any modification to TCP, which enables easy and seamless deployment in public data centers via switch software update. We first present a simple analysis to demonstrate the stability and effectiveness of the scheme, and then we discuss a hardware NetFPGA switch-based prototype. The experimental results from real deployments in a small testbed cluster show the effectiveness of our approach.

Human review
How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers whose main result relates to this one's

Found among the papers closest to this one by title and main claim. Pith's classifier compared each pair's main results and a second model family confirmed the relation; checked against two further families, shown conflicts agreed 118 times in 120 and shown same results 218 times in 239. The quoted sentence is the other paper's main claim.

States the same result 1 paper
  • We also present, three different real implementations (as a Linux kernel module and as an added feature to OpenvSwitch) and give numerical results from both NS-2 simulation and experiments of real deployment in a small test-bed cluster to show its effectiveness in achieving high throughput overall, a good fairness and short flow completion times for delay-sensitive flows.

    Design and Implementation of Fair Congestion Control for Data Centers Networks · 0.82

What it cites · 1 sentence without a confident label

Cites as background 1 paper

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.