MétaCan
Menu
Back to cohort
Record W4416529936 · doi:10.1016/j.comnet.2025.111872

Detecting application transitions and identifying application types for intent-based network assurance: A machine learning perspective

2025· article· en· W4416529936 on OpenAlex

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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueComputer Networks · 2025
Typearticle
Languageen
FieldComputer Science
TopicSoftware-Defined Networks and 5G
Canadian institutionsÉcole de Technologie Supérieure
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsAutoencoderClassifier (UML)Random forestEdge devicePipeline (software)Softmax functionWorkloadEnhanced Data Rates for GSM EvolutionIdentification (biology)

Abstract

fetched live from OpenAlex

• Developed Monitoring tool collectors for fine-grained edge workload monitoring • Lightweight pipeline for intent-based assurance on resource-constrained devices • Real-time detection of application transitions using an autoencoder model • Fast and accurate Application Type Identification via Random Forest classifier • Public AIMED-2025 dataset with 9 workloads on RPi to support the research community Intent-Based Networking (IBN) enables agile and policy-driven network management by translating high-level intents into concrete configurations and continuously validating their compliance. A critical limitation in current Intent-Based Network Assurance (IBNA) systems is the lack of real-time application-level awareness, particularly in dynamic edge environments where AI workloads frequently change. In this work, we address this limitation by introducing a lightweight, monitoring-driven pipeline that enables the detection of application transitions and identification of newly active application types on edge devices. In collaboration with Netdata engineers, we develop multimetric data collectors using Netdata, an open-source platform for real-time system and application monitoring. These collectors capture application-agnostic system metrics with minimal overhead, forming the foundation for real-time alerting and dynamic network adaptation. Our proposed pipeline transforms raw monitoring data into fixed-length vectorized multivariate time series. An undercomplete autoencoder is then used to detect changes in system behavior indicative of application transitions, followed by a Random Forest classifier that labels the newly active application based on its resource usage profile. To support reproducibility, we construct and publicly release the AIMED-2025 dataset, which includes monitoring data from seven MediaPipe-based edge AI applications and two idle states, all executed on a Raspberry Pi. Experimental evaluation demonstrates that our method achieves 100% accuracy in both Application Transition Detection and Application Type Identification using only a three-second observation window. Furthermore, the system exhibits sub-second training times and millisecond-scale inference latency, making it suitable for real-time deployment on resource-constrained edge devices. Once an application change is detected and identified, the IBNA system can automatically alert network administrators and trigger dynamic reconfiguration of network resources to meet the specific performance, security, and connectivity requirements of the active application. By integrating application-level awareness into IBNA, this work advances the state of the art in intent-driven network management and enables more adaptive, efficient, and reliable operation of edge AI systems.

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.847
Threshold uncertainty score0.912

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.0010.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.010
GPT teacher head0.254
Teacher spread0.244 · 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