MétaCan
Menu
Back to cohort
Record W2061068783 · doi:10.1109/ccece.2012.6335034

Early internet traffic recognition based on machine learning methods

2012· article· en· W2061068783 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
TopicInternet Traffic Analysis and Secure E-voting
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceThe InternetPayload (computing)Deep packet inspectionNetwork packetInternet trafficInternet traffic engineeringTraffic classificationField (mathematics)Artificial intelligenceMachine learningPort (circuit theory)Traffic flow (computer networking)Real-time computingData miningComputer networkEngineeringWorld Wide Web

Abstract

fetched live from OpenAlex

The need to quickly and accurately classify Internet traffic for various traffic shaping purposes and security reasons has been growing steadily. This is due to the many new applications that have been taken place in the field of Internet traffic. As conventional port number based and packet payload based methods are no longer adequate, pattern recognition by learning the statistical flow-based features in the training samples to classify the unknown flows has become popular. The applied method should be fast enough to identify the traffic type in real time before the entire flows are finished. This paper proposes a supervised machine learning based method to identify 7 different types of Internet applications. Our proposed system is able to detect the flows application types after observing just a few first packets in each flow in order to run in real time. The overall accuracy of 84.9% was achieved which is a promising result.

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: none
Teacher disagreement score0.971
Threshold uncertainty score0.550

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.033
GPT teacher head0.289
Teacher spread0.257 · 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