Papers for

network operations centers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Time-point encoding improves anomaly detection in multivariate time series

TENET: Time-point Encoding Network for Multivariate Time Series Anomaly Detection

Abstract: In unsupervised multivariate time series anomaly detection (MTSAD), local variation can inflate reconstruction and forecasting errors, making observation-space discrepancy an unreliable indicator of abnormal system behavior. Since latent-space scoring can mitigate this limitation, we reframe one-class MTSAD as current-point system-state compatibility estimation and propose TENET, the Time-point Encoding Network for Multivariate Time Series Anomaly Detection. We define the current-point system state as a latent representation of the target time point, constructed from variable-level temporal context in the input window. TENET constructs this state through a temporal layer that retrieves window context relative to the current point, encodes time with current-point-centered embeddings, and adaptively mixes the retrieved context with the current representation. With this design, TENET treats the input window not as the object to reconstruct, forecast, summarize, or score, but as context for constructing a latent representation evaluated with a fixed standard-normal negative log-likelihood score. Across benchmark datasets, TENET achieves state-of-the-art performance. Additional experiments further show that TENET remains effective under alternative one-class objectives and outperforms substitutions based on generic sequence encoders, suggesting that its advantage comes from decision-aligned representation construction rather than from a specialized scoring rule. These results indicate that one-class MTSAD can be strong when the latent representation is designed around the current time point.

Fri 23 OctMachine LearningArtificial Intelligence
The gist
Detecting unusual patterns in complex time-based data can be tricky because small changes might look like errors when they are not. The authors present TENET, a new approach that looks at the current moment in context with its surroundings to better spot real problems. Instead of trying to recreate or predict the whole data segment, TENET creates a summary focused on the current point and scores how normal it looks. Tests show TENET works better than other methods on standard datasets.
Open → 2610.32337v1

Scheduling methods compared for cloud fog and edge computing

Scheduling in Cloud,Fog, and Edge Computing: A Comparative Analysis and Decision Framework for Technique Selection

Abstract: The increasing heterogeneity and dynamism of cloud, fog, and edge computing make scheduling a challenging problem involving diverse resource capabilities, workload characteristics, latency and energy constraints, and competing optimization objectives. Although numerous scheduling methods have been proposed, existing reviews often provide fragmented coverage of computing environments, scheduling granularities, or technique families, offering limited guidance on selecting an appropriate approach for specific requirements. This review presents a comparative analysis of task, job, and workflow scheduling across the cloud, fog, and edge paradigms, covering heuristic, metaheuristic, learning-based, and hybrid techniques. Studies published between 2020 and 2026 are analyzed according to scheduling granularity, computing environment, optimization objectives, constraints, performance metrics, and evaluation tools. The analysis highlights trade-offs among computational efficiency, optimization capability, adaptability, and implementation complexity across technique families. Heuristic methods offer low computational overhead for relatively stable scheduling conditions, whereas metaheuristic methods are suited to complex and multi-objective optimization problems. Learning-based methods provide greater adaptability to dynamic and uncertain environments but introduce data, training, inference, and convergence requirements. Hybrid methods combine complementary capabilities but generally increase computational and implementation complexity. Based on these findings, a decision framework is developed to guide technique selection according to workload characteristics, environmental conditions, optimization objectives, resource constraints, and computational requirements.

Fri 9 OctDistributed, Parallel, and Cluster Computing
The gist
Scheduling tasks in cloud, fog, and edge computing is complicated because these systems have different types of resources and changing conditions. The authors look at different approaches to scheduling, such as simple rules, complex optimization, machine learning, and combinations of these, comparing their strengths and weaknesses. They explain when each method works best depending on the needs like speed, accuracy, adaptability, and complexity. Finally, they create a guide to help pick the right scheduling method based on the situation and goals.
Open → 2610.13830v1

IoT intrusion detection performance affected by dataset shortcuts

Unmasking Shortcut Learning in IoT Intrusion Detection: A Forensic, Multi-Paradigm Evaluation of Feature Dependence and Data Leakage

Abstract: Machine learning-based Network Intrusion Detection Systems often report near-perfect performance on IoT benchmarks. However, whether these models learn generalizable attack behavior or exploit spurious dataset shortcuts- such as static testbed IP/MAC addresses and chronological recording artifacts-remains an important question. We evaluate the CyberFlowIoT-GICAP benchmark, containing 3,617,388 flow records across 126 PCAP sessions with 849,395 benign flows. Four learning paradigms are evaluated across four feature configurations using PCAP-disjoint splits; LightGBM is additionally evaluated using conventional random-flow splitting. When only statistical flow behavior is used (Fbehav), LightGBM (92.58% +/- 8.18%), Random Forest (92.59% +/- 8.18%), and Deep MLP (92.55% +/- 8.18%) achieve nearly identical Macro-F1, indicating that performance is constrained by feature representation rather than model complexity. With raw timestamps (Ftstamp), tree-based models reach 99.28% Macro-F1, while the linear model remains at 90.62%, showing that nonlinear models can exploit dataset-specific temporal structure. Attack detectability is highly asymmetric: high-rate and active attacks maintain >99.8% recall from flow behavior alone in nonlinear models, whereas the DNS Beaconing drops from 27.78% to 0.00% recall when contextual features are removed. Conventional random-flow splitting increases attack recall by up to 14.00%, highlighting the effect of placing flows from the same sessions in both training and test sets. We conclude with a 4-point protocol checklist for realistic IoT NIDS evaluation.

Wed 23 SeptCryptography and SecurityMachine LearningNetworking and Internet Architecture
The gist
Detecting attacks on Internet-connected devices using machine learning often looks very accurate, but this paper finds that many models learn tricks specific to the test data instead of real attack behaviors. The authors tested several models and feature types on a large IoT network dataset, showing that models can take advantage of time stamps and repeated session info rather than generalizing well. Some attacks are easier to detect than others, and careless testing methods can make performance look better than it really is. They suggest a checklist to better evaluate intrusion detection systems realistically.
Open → 2609.28725v1

Real-time detection of irregular events in periodic data streams

Real-time and adaptive anomaly detection algorithm for cyclostationary models

Abstract: This article introduces PeriodicCALM, an effective real-time anomaly detection framework designed for cyclostationary data streams. While classical cyclostationary processes feature periodically time-varying statistical properties, real-world signals often contain recurring impulsive components that conceal abnormal behavior. Existing real-time methods for struggle with these dynamics, frequently misinterpreting phase-dependent variability as non-cyclic anomalies and causing excessive false alarms. To address this, PeriodicCALM incorporates cycle-dependent variability to systematically ignore regular cyclic impulses while accurately isolating genuine anomalies. Operating in real time with continuous retraining capabilities, the method adapts dynamically to evolving signal characteristics. Comparative evaluations against the baseline CALM framework using simulated data demonstrate significant improvements in detection accuracy and training efficiency, alongside a reduction in prediction latency. Furthermore, the practical utility of PeriodicCALM is validated on real-world vibration signals collected from a compressor monitoring system.

Tue 8 SeptMachine Learning
The gist
Some data has patterns that repeat over time, but these patterns can hide problems or errors. The authors created a new method called PeriodicCALM that can spot true unusual events without getting confused by normal repeating patterns. It works quickly as the data comes in and adjusts itself over time to stay accurate. Tests with both simulated and real data show it works better and faster than older methods.
Open → 2609.09326v1