MétaCan
Menu
Back to cohort
Record W4388625507 · doi:10.1145/3626111.3628182

Harnessing ML For Network Protocol Assessment

2023· article· en· W4388625507 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMachine Learning and Algorithms
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceProtocol (science)Process (computing)Network congestionDistributed computingCommunications protocolNetwork simulationMachine learningArtificial intelligenceComputer networkOperating system

Abstract

fetched live from OpenAlex

In this paper, our primary objective is to showcase that the application of machine learning techniques extends beyond network protocol design. We aim to demonstrate that performance assessment of network protocols, a vital aspect of improving network infrastructures and developing better protocol designs, can be modernized through the utilization of machine learning. As a step towards this goal, we have designed and introduced Mahak, the first tool that harnesses active learning techniques to automate the performance assessment of congestion control schemes. Mahak actively learns to optimize the evaluation process of congestion control schemes so that they can generate their performance maps over a desired space without exhaustively testing them in every scenario. Mahak treats schemes under the test as black boxes. This protocol-agnostic aspect of Mahak enables users to directly assess the performance of the actual implementation of a protocol instead of their over-simplified mathematical models or simplified simulated versions.

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 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.001
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.781
Threshold uncertainty score0.222

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.000
Open science0.0000.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.026
GPT teacher head0.368
Teacher spread0.341 · 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

Quick stats

Citations1
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicMachine Learning and AlgorithmsFrench-language works237,207