MétaCan
Menu
Back to cohort
Record W2786842923 · doi:10.1109/vtcfall.2017.8287914

Network Slicing with Elastic SFC

2017· article· en· W2786842923 on OpenAlexaff
Xu Li, Jaya Rao, Hang Zhang, Aaron Callard

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSoftware-Defined Networks and 5G
Canadian institutionsHuawei Technologies (Canada)
Fundersnot available
KeywordsChainingComputer scienceBin packing problemSlicingHeuristicOptimization problemMathematical optimizationTheoretical computer scienceAlgorithmBinArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

Network slicing often involves instantiation of certain network functionality into network nodes, possibly subject to function chaining constraints. In this paper, we introduce the novel concept of elastic service function chain (SFC), which is an ordered list of virtual functions that may be optional or recursive, and we address network slicing with such chaining constraints as a Software Defined Topology (SDT) problem. We formulate the SDT problem as a combinatorial optimization problem that includes a multi-commodity flow problem and a bin packing problem as sub-problems. Since it inherits NP hardness from the bin packing sub problem, we develop a heuristic algorithm to tackle it. The algorithm's effectiveness and performance are evaluated via 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 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: Observational · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.908
Threshold uncertainty score0.468

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.0010.000
Scholarly communication0.0000.000
Open science0.0010.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.017
GPT teacher head0.226
Teacher spread0.209 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designObservational
Domainnot available
GenreMethods

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

Citations21
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicSoftware-Defined Networks and 5GFrench-language works237,207