MétaCan
Menu
Back to cohort
Record W1551492997 · doi:10.1109/iccnc.2015.7069497

Creating logical zones for hierarchical traffic engineering optimization in SDN-empowered 5G

2015· article· en· W1551492997 on OpenAlexaff
Xu Li, Hang Zhang

Bibliographic record

Venue2015 International Conference on Computing, Networking and Communications (ICNC) · 2015
Typearticle
Languageen
FieldComputer Science
TopicSoftware-Defined Networks and 5G
Canadian institutionsHuawei Technologies (Canada)
Fundersnot available
KeywordsComputer scienceContext (archaeology)HeuristicTraffic engineeringZoningSoftware-defined networkingDistributed computingController (irrigation)SoftwareMathematical optimizationTopology (electrical circuits)Computer networkEngineeringMathematicsGeographyArtificial intelligence

Abstract

fetched live from OpenAlex

Software defined networking (SDN) decouples control plane functionality from the data plane and performs traffic engineering (TE) through a central SDN controller. Centralized TE is impractical when the network becomes too large in size or in loading. Zone-based hierarchical TE comes into play under this circumstance, where the TE problem is decomposed into sub problems related to zones and tackled collectively by local zone controllers. As an integral part of this TE approach, zoning was studied in a very limited context. Existing solutions generate geographic zones and suit only arc-model TE optimization. In this paper, we advance the state of the art by proposing logical zones to support path-model TE optimization. Logical zones are created by coupling traffic flows to zone controllers. We mathematically formulate the zoning problem in different cases, where the number of available controllers is equal to, or larger than that of zones required. These problems are NP hard. We develop novel heuristic solutions and present comparative simulation study.

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.002
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.004
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.092
GPT teacher head0.320
Teacher spread0.228 · 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

Citations5
Published2015
Admission routes1
Has abstractyes

Explore more

Same venue2015 International Conference on Computing, Networking and Communications (ICNC)Same topicSoftware-Defined Networks and 5GFrench-language works237,207