MétaCan
Menu
Back to cohort
Record W2157178313 · doi:10.1109/ccece.2006.277444

Data Mining Network Traffic

2006· article· en· W2157178313 on OpenAlexaff
Ian W. C. Lee, Abraham O. Fapojuwo

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsHurst exponentComputer scienceIntermittencyData miningNetwork packetFuzzy logicArtificial intelligenceStatisticsMathematicsComputer network

Abstract

fetched live from OpenAlex

In this paper we present a novel approach to network traffic analysis. In particular, we show how to determine which statistical traffic descriptors are most pertinent in predicting important network performance metrics such as packet loss rate, based on empirical data. In addition, we reveal the relationship between the pertinent traffic descriptors and packet loss rate via fuzzy if-then rules. The principal finding of this paper is that descriptors that quantify intermittency such as the generalized fractal dimensions D1, D2 and D3 or parameter that quantify variability such as the Holder exponent h1 are better indicators of packet loss rate than the more commonly used Hurst parameter H and tail exponent alpha of a long-range dependent and heavy-tail random variable, respectively. A simple fuzzy inference system that incorporates rules generated from these traffic descriptors was able to predict the packet loss rate reasonably well, verifying the above claim

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

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.011
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.011
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0080.006
Science and technology studies0.0010.000
Scholarly communication0.0020.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.001

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.274
Teacher spread0.248 · 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 source (direct Gemma or distilled Codex), 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
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicComplex Network Analysis TechniquesFrench-language works237,207