MétaCan
Menu
Back to cohort
Record W3214744430 · doi:10.1109/access.2021.3129990

Towards a Self-Driving Management System for the Automated Realization of Intents

2021· article· en· W3214744430 on OpenAlexafffund
Kristina Dzeparoska, Nasim Beigi-Mohammadi, Ali Tizghadam, Alberto Leon‐Garcia

Bibliographic record

VenueIEEE Access · 2021
Typearticle
Languageen
FieldComputer Science
TopicSoftware-Defined Networks and 5G
Canadian institutionsTelus (Canada)University of Toronto
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceAbstractionComplexity managementKey (lock)Realization (probability)Control (management)Separation of concernsNetwork monitoringAbstraction layerSoftware engineeringDistributed computingComputer securityArtificial intelligenceComputer networkProgramming languageSoftware

Abstract

fetched live from OpenAlex

Network management faces the interrelated challenges of increasing network complexity, meeting sophisticated business requirements, and being subject to human oversight. Self-driving networks possess the key properties to overcome such challenges. We present and implement a management system that addresses several elements of a self-driving network. Our system leverages intents, a policy-based paradigm and autonomic control loops. Intent-based networking allows us to formalize how an intent can be provided as input to a control loop, and how the complexities can be abstracted from the user. To realize and assure the intent, autonomic networking enables us to create Monitor-Analyze-Plan-Execute (MAPE) loops. Finally, we execute the control loops using a policy-based approach. We propose a policy abstraction to support requirements at different levels of abstraction, and an Application Programming Interface (API) layer to reduce management complexity from the user perspective. We propose a formal policy information model to model policies across layers of abstractions and to support simplified mapping and strong consistencies among various policy abstraction levels. We have implemented our proposal and present a proof-of-concept use-case to showcase the intent refinement.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.982
Threshold uncertainty score0.228

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.001
Science and technology studies0.0000.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.028
GPT teacher head0.296
Teacher spread0.268 · 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 designSimulation or modeling
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

Citations25
Published2021
Admission routes2
Has abstractyes

Explore more

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