MétaCan
Menu
Back to cohort
Record W2037974832 · doi:10.1109/netwks.2010.5624943

On the design problem of two-level IP networks

2010· article· en· W2037974832 on OpenAlex
Steven Chamberla

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
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsPolytechnique Montréal
Fundersnot available
KeywordsComputer scienceTabu searchComputer networkModular designNetwork planning and designRouting (electronic design automation)RouterRouting protocolThe InternetDistributed computingAlgorithm

Abstract

fetched live from OpenAlex

In this paper, we propose to tackle the design problem of two-level metropolitan Internet protocol (IP) networks with modular routers including the design of the points of presence. We first propose a model that deals with selecting the number of routers and their types to install in each point of presence, selecting the interface card types to install in each router, finding the access and the backbone networks, interconnecting the routers in each point of presence, selecting the link types and finally, routing the traffic. The objective is to find the minimum cost network. Moreover, we consider that a minimum information rate (in bps) is guaranteed between each pair of clients for the normal state of the network and for the failure scenarios of interest to the network planner. A tabu search metaheuristic algorithm is proposed to find near-optimal approximate solutions of the model. Finally, we present numerical results to assess the performance of the proposed algorithm.

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.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: Methods · Consensus signal: none
Teacher disagreement score0.638
Threshold uncertainty score0.235

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.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.023
GPT teacher head0.225
Teacher spread0.201 · 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

Citations4
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Optical Network TechnologiesFrench-language works237,207