MétaCan
Menu
Back to cohort
Record W2156339229

On the importance of local connectivity for Internet topology models

2009· article· en· W2156339229 on OpenAlexaff
Hamed Haddadi, Damien Fay, Almerima Jamakovic, Olaf Maennel, Andrew W. Moore, Richard Mortier, Steve Uhlig

Bibliographic record

VenueTNO Repository · 2009
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsMcGill University
Fundersnot available
KeywordsTopology (electrical circuits)Network topologyInternet topologyComputer scienceHierarchyToolboxHierarchical network modelLogical topologyThe InternetGraphTheoretical computer scienceFocus (optics)Distributed computingMathematicsComputer network
DOInot available

Abstract

fetched live from OpenAlex

(AS) topology generation make structural assumptions about the AS graph. Those assumptions typically stem from beliefs about the true properties of the Internet, e.g. hierarchy and powerlaws, which arise from incorrect interpretations of incomplete observations of the AS topology. In this paper we compare AS topology generation models with several observed AS topologies without making assumptions as to the relative importance of different topological characteristics. We find that although existing AS topology models capture degree-based properties well, they fail to capture the complexity of the local interconnection structure between ASes. We use a wide range of metrics including the weighted spectral distribution and make it available as toolbox 1. We show that the shortcomings of existing models stem from underestimating the complexity of connectivity in the core due to incomplete understanding of collected data limitations, and narrow focus on particular aspects of the AS topology structure. I.

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.006
metaresearch head score (Gemma)0.045
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.029

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.045
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.003
Scholarly communication0.0030.006
Open science0.0020.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.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.014
GPT teacher head0.227
Teacher spread0.213 · 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

Citations19
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueTNO RepositorySame topicNetwork Traffic and Congestion ControlFrench-language works237,207