MétaCan
Menu
Back to cohort

TCP Congestion Avoidance in Data Centres using Reinforcement Learning

2021· article· en· W3133904720 on OpenAlexaff
Ali Hassan, Shahram Shah Heydari

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsOntario Tech University
Fundersnot available
KeywordsComputer scienceTCP tuningComputer networkZeta-TCPTCP Friendly Rate ControlReinforcement learningTCP accelerationNetwork congestionThroughputTCP Westwood plusH-TCPThe InternetTransmission Control ProtocolArtificial intelligenceNetwork packetTelecommunicationsWirelessWorld Wide Web

Abstract

fetched live from OpenAlex

TCP, a transport layer protocol which ensures the reliable delivery of information on the network, is the basis of Internet connectivity, with 85% of the worlds Internet traffic being TCP based. TCP however, is slow to adapt to changes in the network, drastically reducing the throughput at the first sign of possible congestion, thereby preventing rapid restoration of the throughput. Mitigating this problem has been a very active area of research, as, until recently, the idea of using Artificial Intelligence (AI) in this space was relatively limited. Recently, Reinforcement Learning (RL), a form of AI, has been explored in the networking space, and in enhancing the performance of TCP,this paper aims to expand the use of RL for TCP (TCP-RL) in a software-defined data centre for the purpose of network congestion avoidance based on host-based TCP metrics. We demonstrate that our proposed approach is able to significantly reduce the impact of congestion on the end-to-end network throughput within the data centre.

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 distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.968
Threshold uncertainty score0.347

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.043
GPT teacher head0.272
Teacher spread0.229 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations2
Published2021
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Traffic and Congestion ControlFrench-language works237,207