Last updated: 2026-11-16 05:01 UTC
All documents
Number of pages: 178
| Author(s) | Title | Year | Publication | Keywords | ||
|---|---|---|---|---|---|---|
| Mohammad Saberi, Ali Ahmadi Esfidi, Mahdi Dolati, Naeimeh Omidvar | FlexINA: In-Network Aggregation for Accelerating Distributed Machine Learning with Flexible Routing | 2026 | Early Access | Modeling Switches Timing Routing Machine learning Training Runtime Memory Loading Topology Distributed Machine Learning Programmable Networks In-Network Computing | The growing scale and complexity of modern machine learning (ML) models have rendered distributed training indispensable. However, as model dimensions expand, communication overhead increasingly dominates the overall training time, creating a critical performance bottleneck. While techniques such as gradient compression offer partial relief, they often incur substantial computational overhead or require specialized hardware. In-network aggregation (INA) has emerged as a compelling alternative, offloading partial computations—such as gradient reduction—directly onto programmable network switches. Yet, current INA frameworks predominantly rely on rigid, static routing schemes or uncoordinated, opportunistic aggregation, fundamentally limiting their capacity to exploit the full potential of programmable data planes. To address this limitation, we formulate the Joint Scheduling-Routing for In-Network Aggregation (JINA) problem. JINA introduces a time-slotted execution model to enable fine-grained temporal scheduling synchronously with spatial routing. By leveraging source routing, it dictates perpacket forwarding paths while explicitly coordinating multi-hop partial aggregation across the network. Furthermore, we propose FlexINA, a scalable optimization framework that solves the JINA problem through a three-phase dimensionality reduction strategy: host-level pre-aggregation, topological switch filtration, and temporal window partitioning. Extensive evaluations across fifteen diverse network topologies demonstrate that FlexINA reduces the total network load by up to 8.3% compared to INA baselines, while maintaining high computational efficiency. | 10.1109/TNSM.2026.3740503 |
| Zhaogang Shu, Dawei Lin, Haihui Xie, Shuwu Chen | PeriSTNet: A Topology-Anchored Residual Graph Evolution Model for Multi-Step Traffic Matrix Forecasting | 2026 | Early Access | Forecasting Modeling Matrices Learning (artificial intelligence) Timing Topology Educational institutions Conferences Sequences Sequential analysis Traffic Matrix Forecasting Spatio-Temporal Graph Neural Networks Residual Graph Evolution Topology Anchoring Wide Area Networks | Accurate multi-step Traffic Matrix (TM) forecasting enables Wide Area Network (WAN) operators to plan capacity, anticipate congestion, and assess traffic-engineering actions before service quality is affected. Existing spatio-temporal graph neural networks often rely on a fixed physical topology, whereas fully data-driven and long-sequence models may not explicitly retain network-structure priors. These choices can miss demand correlations induced by routing and application behavior, while recursive decoding can accumulate error at longer horizons. We propose PeriSTNet, a topology-anchored residual graph evolution framework that learns a sparse, phase-conditioned predictive dependency graph around a physical topology prior. This graph is integrated into a Dual-Graph Fusion Gated Recurrent Unit, and a Spatio-Temporal Shortcut stabilizes recursive rollouts. Across Abilene, GÉANT, and CERNET, PeriSTNet achieves lower aggregate MAE, MAPE, and RMSE than the evaluated graph-based and Transformer baselines; horizon-wise, multi-seed, and efficiency analyses support this result under one reproducible protocol. By coupling dynamic predictive dependencies with a stable physical backbone, PeriSTNet provides a lightweight forecasting component for proactive capacity planning and traffic-engineering workflows. | 10.1109/TNSM.2026.3753266 |
| Umair Ullah Tariq, Fariza Sabrina, Steven Gordon, Ahsan Morshed, Yufeng Lin, Mohammad Mamunur Rashid, Mubashir Hussain | SLA-Driven Network Planning for Hybrid QKD–PQC Security in Smart Grids | 2026 | Early Access | Technology Costing Seeds (agriculture) Maintenance engineering Gallium Educational institutions Planning Joining processes Quantum key distribution Timing Network planning service-level agreements quantum-safe security quantum key distribution post-quantum cryptography smart grid networks infrastructure management feasibility optimization | Operational deployment of hybrid QKD–PQC security in smart grids requires coordinated planning under coupled service-level agreement (SLA) constraints, including startup latency, sustained key availability, real-time bounds, technology budget, and site storage capacity. This paper presents an SLA-driven network-planning framework solved using feasibility-first bounded local search (FF-BLS). A broad 36,300-run campaign across seven benchmark networks (14–6,495 nodes) maps deployment regimes and algorithmic ablations. Full FF-BLS attains 60.9% feasibility under fixed installed site capacity, while relaxing the site-cap constraint yields 100%. Focused studies further vary storage, technology budget, QKD-adoption target, and startup–traffic stress. FF-BLS reaches 100% feasibility at the highest tested storage multiplier (γ = 0.40), while a restrictive technology budget (b = 0.60) remains independently binding once storage is sufficient. On 246 comparison scenarios, FF-BLS achieves 100% feasibility, whereas unassisted GA, SA, Tabu, and VNS achieve 24.4–58.9%; feasibility-aware initialization and repair substantially improve the generic baselines. A separate 100-instance topology/storage stress benchmark and an aligned CPU–GPU study evaluate robustness and computational scaling. The results show that site storage is the dominant practical bottleneck under fixed installed capacity, while its importance depends on the provisioning regime. Low-to-moderate QKD adoption is most robust under constrained storage, whereas higher adoption becomes feasible when sufficient storage head-room is provisioned. These findings provide practical guidance for scalable quantum-safe smart-grid deployment under stringent SLAs. | 10.1109/TNSM.2026.3751647 |
| Huiying Jin, Jianyong Zhang, Jiajia Li, Hai Dong, Pengcheng Zhang, Jian Zhou | Dynamic Resource Allocation for Multi-Type Tasks in Mobile Edge Computing | 2026 | Early Access | Resource management Optimization Algorithms Timing Internet of Things Modeling Service level agreements Collaboration Elementary particles Bismuth Multi-type tasks Accurate matching scheme Multi-Node collaboration Dynamic resource allocation | We propose MD-SFLAPSO (/ˌemdi ˈsflæpsəʊ/), a Multi-type task-oriented Dynamic resource allocation method based on Shuffled Frog Leaping Algorithm and Particle Swarm Optimization for the mobile edge computing environment. MD-SFLAPSO offers an optimized resource allocation strategy. It incorporates a precise matching scheme that accounts for task requirements, collaborative node capabilities, spatial location correlation, latency constraint satisfaction, and resource supply-demand matching degree, to achieve effective collaboration. Additionally, we introduce a multi-node collaborative dynamic resource allocation strategy by leveraging user mobility patterns. Our approach is validated through a series of experiments using public data sets. The results show that MD-SFLAPSO reduces the average SLA violation rate by 8.8 percentage points from the pre-optimization level, improves average resource utilization by 9.3 percentage points over SFLA-RA, and adapts well to different resource configuration scenarios. | 10.1109/TNSM.2026.3751416 |
| Aleksandar Avdalović, Joseph Khoury, Ibrahem AlJabea, Mustafa Hajij, Elias Bou-Harb | Beyond Flat Models: Preserving ICS Topology using Combinatorial Complexes for Hierarchy-Aware Intrusion Detection | 2026 | Early Access | Modeling Cells (biology) Integrated circuits Tagging Ranking (statistics) Image sensors Location awareness Signal detection Security Conferences Industrial Control Systems Intrusion Detection Anomaly Localization Topological Deep Learning Combinatorial Complexes Purdue Model Cyber-Physical Security | Industrial Control Systems (ICS) follow the Purdue model hierarchy, organizing sensors, actuators, Programmable Logic Controllers (PLCs), and supervisory control into distinct hierarchical layers. Despite this inherent structure, existing data-driven intrusion detectors still fail to model this intricate property. To address this gap, we introduce a Hierarchy-Aware Intrusion Detector, HAID, a topology-preserving framework that models an ICS as a Combinatorial Complex (CC), operating solely on process telemetry and trained on benign traces to detect falsified sensor measurements and unauthorized actuator commands. The complex captures devices, functional interactions, and PLC control zones within an ICS. CCs (unlike flat models) encode telemetry across hierarchical levels for training a Topological Neural Network (TNN). As such, HAID enables the embedding of the ICS Purdue model into the learning process, yielding anomaly scores and localization at each of the aforementioned levels. Evaluated on two water testbeds, SWaT and WADI, and on a simulated chemical process, TEP, HAID achieves competitive detection performance (82.7% F1 on SWaT and 50.1% on WADI, averaged over five runs), while providing explicit hierarchical localization unavailable in prior work. Through ablations, we confirm the added-value of hierarchical modeling, as removing the PLC-zone representation reduces F1 by 5.8 percentage points on SWaT and causes detection on WADI to collapse. The largest losses are on attacks that manipulate several devices at once, which device- and interactionlevel signals usually miss. | 10.1109/TNSM.2026.3746967 |
| Soonbeom Kwon, Yusu Noh, Youngwoo Jang, Illyoung Choi, Byungchul Tak, In-geol Chun, Young-Kyoon Suh | Scalable and Robust Resource Provisioning via Adaptive Task Scheduling for Edge Devices | 2026 | Early Access | Schedules Scheduling Cloning Timing Educational institutions Computers Transcoding Videos Tail Edge computing Edge devices Edge server Resource augmentation Task distribution Kubernetes | Edge devices, such as wearables, drones, and CCTV systems, are vital for real-time data collection in urban intelligence. However, their limited computational and storage capacities pose significant challenges. While offloading to public clouds offers scalability, it often incurs high latency and operational costs. Conversely, centralizing workloads on edge servers may result in the underutilization of high-performance edge devices. To address these limitations, we introduce ERPF, a Kubernetes-based Edge Resource Provisioning Framework that augments the capabilities of heterogeneous edge environments. ERPF orchestrates dynamic volume provisioning, GPU-aware resource allocation, execution context migration, and adaptive task distribution to improve system flexibility and efficiency. Building on this, we propose a novel adaptive task scheduling technique, termed eATS, composed of three key mechanisms: (i) Partition Smoothing Scheme for stable task granularity control, (ii) Resilient Edge Reintegration for failure detection and task reassignment, and (iii) Competitive Task Cloning for speculative execution with fastest-result commitment. The proposed eATS scheme reduces task execution time by up to 27.6%, lowers partition size variability by 8.7×, and improves scheduling robustness across heterogeneous edge devices over the baseline. | 10.1109/TNSM.2026.3694238 |
| Jingyan Wang, Jing Bai, Lina Liu, Fumio Machida, Xiaolin Chang | Improving Dependability of VM-based Multi-Domain Service Function Chain: A Semi-Markov Modeling Approach | 2026 | Early Access | Aging Availability Modeling Software Steady-state Timing Virtual machines Simulation Radio access networks Regional area networks Dependability Service function chain Semi-Markov process Software aging Virtualization | In Network Function Virtualization (NFV) networks, service functions (SFs) can be deployed on virtual machines (VMs) across Multiple domains and then form a Service Function Chain (MSFC) for end-to-end network service provision. It is a fact of life that any software component in a VM-based MSFC must experience software aging after a long period of continuous operation. This paper quantitatively investigates the capability of proactive rejuvenation techniques in reducing the damage of software aging on a VM-based MSFC. We develop a semi-Markov model to capture the behaviors of SFs, VMs, and virtual machine monitors (VMMs) from software aging to recovery under the condition that failure times and recovery times follow general distributions. Note that the holding times of aging events follow exponential distributions. We derive the formulas for calculating the steady-state availability and reliability of the VM-based MSFC composed of multiple SFs running on VMs hosted by VMMs. Sensitivity analysis is also conducted to identify potential dependability bottlenecks. Various numerical and simulated experiments show the approximate accuracy of the proposed model and the metric formulas we derived. The experiment results also indicate that the aging time is an important parameter for VM-based MSFC dependability and the type of failure time distribution has a significant impact on dependability metrics. | 10.1109/TNSM.2026.3752685 |
| Yichen Zhang, Di Chen, Kaijie Zhu, Zekun Tao, Wei Lin, Rui Zheng | Beyond Valley-Free: Transformer-based AS Path Inference Using Path Embedding | 2026 | Early Access | Border Gateway Protocol Routing Ranking (statistics) Modeling Training Transformers Measurement Conferences Heart rate Probability AS path inference inter-domain routing Border Gateway Protocol network traffic analysis | Gaining insight into autonomous system (AS)-level paths is essential for understanding Internet routing behaviors and enhancing inter-domain routing security. Due to increasingly complex Internet topology and limited measurement access (e.g., router-side ICMP restrictions), few AS paths can be accurately observed, making AS path inference a necessity. However, most existing inference methods are developed based on the valley-free constraint. This limits their ability to capture real-world dynamic routing behaviors. In this paper, we propose PathRank, a Transformer-based method that infers AS paths from a source-AS to a destination-prefix through probability-based ranking, thereby closely reflecting real-world inter-domain routing complexities. From observable BGP data, PathRank generates candidate paths, encodes them as embeddings for a self-attention mechanism to capture cross-hop dependencies, and employs a prefix-length-weighted loss function during training to reflect real-world traffic impacts.We conduct experiments on large-scale public BGP datasets covering IPv4 and IPv6. PathRank places the observed BGP path among the top-10 ranked candidates in 96.82% (IPv4) and 96.65% (IPv6) of test cases, outperforming the strongest external baseline by 4.20 and 11.72 percentage points, respectively. On non-valley-free cases, where valley-free-constrained methods degrade significantly, PathRank maintains inference performance. | 10.1109/TNSM.2026.3752819 |
| Jiawei Dong, Mohsen Ghafouri, Chadi Assi | Cybersecurity Risks in Electric Vehicle Charging Management Systems | 2026 | Early Access | IP networks Security Internet of Things Malware Electric vehicle charging Management Dark Web Portals Internet Large language models Darknet Electric Vehicle Charging LLMs Malware Vulnerability Analysis Honeypot | Electric Vehicle Charging Stations (EVCSs) have become the heart of electrified transportation infrastructure. Their increasing Internet exposure makes them high-value targets for cyberattacks with potential implications for grid stability. This study presents a comprehensive, data-driven security analysis of globally exposed EV Charging Management Systems (EVCMS), bridging theoretical vulnerability concerns with quantified real-world threats. We discover and assess Internet-exposed EVCMS infrastructure, then deploy multi-component honeypot systems to capture live attack intelligence. Our novel EVCS discovery technique identifies 59,359 EVCMS IPs from 798 vendors, with notable improvements in non-English-speaking regions, overcoming traditional scanning limitations. Security assessment of 17 vulnerability types reveals most critical vulnerabilities remain unaddressed three years after coordinated disclosure. Darknet intelligence analysis reveals 10,647 unique IPs that also appeared in our EVCMS dataset participating in unsolicited scanning throughout 2024 with periodic surges. We deploy a comprehensive honeypot system with proactive engagement that actively induces compromised EVCMS devices to attack our infrastructure, spanning two monitoring phases: a ten-day period with proactive engagement and an eight-month period of long-term passive monitoring. We observed generic IoT threats and found no EVCMS-specific malware in the samples examined. A small portion of human exploration activities is found in the web portal honeypot. We observed liveness probes on both the Linux server honeypots and the OCPP backend, serving as a critical warning of imminent threats demanding immediate vendor attention before escalation to destructive campaigns. | 10.1109/TNSM.2026.3751489 |
| Mayank Ramnani, Shasank Dixit, Sushil Yadav, Saad Ahmed, Sidharth Sharma | Split-Aware Function Placement with Availability Guarantees and Optical Provisioning in vRANs | 2026 | Early Access | Radio access networks 5G mobile communication Joining processes Topology Regional area networks Gallium Modeling Copper Optimization Costing 5G virtualized RAN VNF placement network slicing lightpath provisioning DWDM shared backup functional splitting genetic algorithm | The rapid evolution of beyond-5G and emerging 6G networks is driving the need for flexible, reliable, and cost-efficient virtualized Radio Access Network (vRAN) architectures capable of supporting heterogeneous services such as enhanced Mobile Broadband (eMBB), Ultra-Reliable Low-Latency Communication (URLLC), and Massive Machine-Type Communication (mMTC). Future disaggregated RAN systems are expected to rely heavily on network slicing, functional split flexibility, and optical x-haul infrastructures to support stringent performance, scalability, and availability requirements. In this paper, we present an integrated framework for reliable, slice-aware, and functional split-aware Virtual Network Function (VNF) placement with lightpath provisioning in disaggregated vRAN environments. The proposed approach maximizes mobile network operators’ profit by jointly optimizing function placement and optical resource allocation under latency, processing, bandwidth, and availability constraints. We formulate the problem as an Integer Linear Programming (ILP) model with two variants: one that employs unshared backups and another that uses a more cost-efficient shared backup scheme. To address ILP complexity, we develop a heuristic algorithm and a GA-based metaheuristic that provide computationally efficient alternatives for larger instances. Extensive evaluations on topologies up to 128 nodes show that shared backup variants yield up to 18% higher profit, while maintaining up to 5–10% lower normalized CPU usage than unshared counterparts. | 10.1109/TNSM.2026.3751852 |
| Jinzhe Wu, Quansheng Guan, Shugang Hao, Shengming Jiang, F. Richard Yu | Buffer-Induced Optimization Flow Control for Communication Networks | 2026 | Early Access | Joining processes Delays Throughput Fluid flow Pricing Optimization Bagging Information rates Algorithms Flow production systems Optimize Flow Control Buffer Bloat Mitigation Network Throughput Maximization | Congestion is the main bottleneck for throughput improvement in communication networks. Since link buffer is an essential and early indicator for congestion, we formulate a buffer-induced optimization (BIO) flow control problem using the network utilization maximization framework. BIO uses link buffer dynamics to regulate source rates. We then derive a buffer-induced asynchronous gradient (BAG) algorithm using Lagrange duality. BAG allows links to price their buffer and allows sources to compute their rates based on path prices distributedly and iteratively. We prove the convergence and optimality of the source-link iterations under asynchronous price and rate updates. To prevent buffer bloat happening in practical networks, we also adopt a buffer shrink mechanism for BAG. Simulation results show that BAG can quickly sense the changes of network status and dynamically capture the optimal network throughput. BAG also achieves higher throughput and stronger robustness to bursts than the existing rate-based flow control and congestion control algorithms. | 10.1109/TNSM.2026.3751275 |
| Mario Chahoud, Hani Sami, Ahmad Hammoud, Rabeb Mizouni, Hadi Otrok, Jamal Bentahar, Azzam Mourad, Chamseddine Talhi | Multi-agent Deep Reinforcement Learning Scheme for On-Demand Federated Learning | 2026 | Early Access | Modeling Federated learning Training Learning (artificial intelligence) Convergence Accuracy Internet of Things Resource management Servers Optimization Federated Learning Multi-Agent Deep Reinforcement Learning On-Demand Federated Learning Client Selection Mobility-Aware Learning Partially Observable Markov Game Centralized Training and Decentralized Execution Edge Computing | The rapid growth of intelligent IoT devices and mobile edge infrastructures has generated massive decentralized data, necessitating efficient and privacy-preserving learning. Federated Learning (FL) enables distributed model training without sharing raw data; however, its performance degrades in dynamic mobile environments due to unpredictable availability, stragglers, and frequent dropouts. In On-Demand FL, training services and models are deployed only when needed rather than relying on always-active infrastructure, requiring orchestrators to adapt to client arrivals, departures, and mobility while efficiently allocating limited resources and maintaining training continuity. Existing client-selection methods rely on static heuristics or centralized Reinforcement Learning models that struggle to scale and adapt to such dynamics. To address these challenges, we propose a cooperative Multi-Agent Deep Reinforcement Learning (MADRL) framework for client selection in On-Demand FL. Multiple orchestrators act as agents under a Centralized Training and Decentralized Execution (CTDE) paradigm. The problem is formulated as a Partially Observable Markov Game (POMG), capturing mobility, partial observability, and distributed decision-making. A mobility-aware reward integrates accuracy, resource efficiency, and a Useful Handoff Bonus to preserve learning continuity. Containerization further enhances adaptability. Experiments demonstrate faster convergence, improved resource utilization, and enhanced robustness under real mobility traces. | 10.1109/TNSM.2026.3750310 |
| Ting-Yu Chang, Cooper Cheng-Yuan Ku | Two-tier Framework with AutoML for Detection and Classification of Multiple Types of Anomalies in Intrusion Attacks | 2026 | Early Access | Modeling Optimization Probability Automated machine learning Labeling Training Algorithms Stacking Accuracy Tuning Intrusion Detection Anomaly Classification Cybersecurity Data Imbalance Computational Efficiency Two-tier Framework Machine Learning Probability Stacking Method | Ensuring cybersecurity is paramount for protecting sensitive data and defending against increasingly sophisticated cyberattacks. Consequently, intrusion detection (ID) has become a critical area of research in network security. This paper proposes a two-tier framework that leverages efficient automated machine learning (AutoML) techniques to address data imbalance and optimize feature combinations for ID and classification of multiple types of anomalies. In the first tier, two complementary models are selected: a primary model optimized for overall dataset performance and a secondary model specifically chosen for its effectiveness on balanced data distributions. In the second tier, a probability stacking approach, supported by Out-of-Fold (OOF) cross-validation, integrates insights from the first-tier models. It acts as a binary safety net that successfully recovers rare minority attacks while preventing irreversible information loss. The proposed framework effectively mitigates the adverse effects of data imbalance while requiring only a minimal runtime memory footprint of approximately 44 MB (NSL-KDD) and a total process footprint of 165.52 MB (CIC-IIoT-2025), and achieves a rapid cold-start initialization of 0.85 seconds. These advantages make it well-suited for edge computing. Experimental results on the NSL-KDD dataset demonstrate that the proposed approach achieves an overall accuracy of 99.73%, outperforming many state-of-the-art methods by 0.4-20.6%. Furthermore, evaluations on the CIC-IDS-2017 dataset show a 6.3% accuracy improvement and a significant 36% increase in macro-average recall compared with a random-forest-only (RF-only) model. Moreover, extensive validation on the contemporary CIC-IIoT-2025 dataset reveals a significant 4.20% improvement in Macro F1-score over up-to-date baselines. Finally, evaluations on an independent set with novel attack types (KDDTest+) confirm strong generalization capability, achieving 77.10% accuracy and underscoring the framework's robustness in modern industrial scenarios. | 10.1109/TNSM.2026.3747311 |
| Junxiong Lin, Xiuyi Zhao, Pan Li, Tian-Yu Zuo, Mingyi Liu, Hailiang Zhao, Yichuan Jiang, Jiuchuan Jiang, Kai Di, Ning Luo | Hallucination-Aware Teaming for Reliable Service Composition in LLM-Driven Industrial Agent Networks | 2026 | Early Access | Modeling Large language models Educational institutions Costing Algorithms Conferences Collaboration Multi-agent systems Voting Social networking (online) LLM-driven industrial agent hallucination teaming reliable service composition multi-agent system | Large-language-model-driven (LLM-driven) industrial agents increasingly exchange intermediate results through service-composition pipelines, so an upstream hallucination can corrupt several downstream decisions. We formulate hallucination-aware teaming (HATP), which jointly considers capability coverage, distinct-base-family redundancy, resource budgets, and chain-level error propagation, and prove that its deterministic special case is NP-hard. We then propose HAT, a polynomial-time heuristic that combines master-driven recruitment with self-consistency, cross-agent agreement, external-constraint signals, and bounded fallback. In five simulator settings with 200 paired trials each, HAT has the highest mean Acc and lowest mean HPL in four settings; LLM Debate leads in Easy, and the HAT–Debate Acc differences in Easy and Complex are not significant after Holm correction. A 100-instance exact-enumeration study yields a 0.95% median relative utility gap and an approximately 10× median speedup for the tractable HATP instantiation with upstream discount and fallback disabled and a fixed scalar utility with normalized propagation length. Paired ablations show clear contributions from Phase B, bounded fallback, and the combined trust mechanism, whereas most individual trust-signal effects overlap with uncertainty. In a fixed 50-task live-LLM check using five 8B–30B model families, HAT attains Acc 0.280 versus 0.300 for Beta-Reputation and does not lead every comparator on propagation length. The live study is therefore a limited test outside the simulator and does not show that HAT is generally better in deployment. | 10.1109/TNSM.2026.3752977 |
| Jing Zhang, Chao Luo, Rui Shao | MTG-GAN: A Masked Temporal Graph Generative Adversarial Network for Cross-Domain System Log Anomaly Detection | 2026 | Early Access | Anomaly detection Adaptation models Generative adversarial networks Feature extraction Data models Load modeling Accuracy Robustness Contrastive learning Chaos Log Anomaly Detection Generative Adversarial Networks (GANs) Temporal Data Analysis | Anomaly detection of system logs is crucial for the service management of large-scale information systems. Nowadays, log anomaly detection faces two main challenges: 1) capturing evolving temporal dependencies between log events to adaptively tackle with emerging anomaly patterns, 2) and maintaining high detection capabilities across varies data distributions. Existing methods rely heavily on domain-specific data features, making it challenging to handle the heterogeneity and temporal dynamics of log data. This limitation restricts the deployment of anomaly detection systems in practical environments. In this article, a novel framework, Masked Temporal Graph Generative Adversarial Network (MTG-GAN), is proposed for both conventional and cross-domain log anomaly detection. The model enhances the detection capability for emerging abnormal patterns in system log data by introducing an adaptive masking mechanism that combines generative adversarial networks with graph contrastive learning. Additionally, MTG-GAN reduces dependency on specific data distribution and improves model generalization by using diffused graph adjacency information deriving from temporal relevance of event sequence, which can be conducive to improve cross-domain detection performance. Experimental results demonstrate that MTG-GAN outperforms existing methods on multiple real-world datasets in both conventional and cross-domain log anomaly detection. | 10.1109/TNSM.2026.3654642 |
| Messaoud Ait-Yahia, Wael Jaafar, Rami Langar | Joint Design of Blockchain-Enabled Service Placement and Task Assignment in Vehicular Fog Computing Networks | 2026 | Early Access | Delays Timing Optimization Autonomous aerial vehicles Modeling Gallium Central Processing Unit Joints Bandwidth Elementary particles Resource allocation Blockchain VNF placement task assignment vehicular fog computing PSO GA IoV | Driven by the evolution of blockchain and fog computing, vehicular networks are increasingly capable of supporting latency-sensitive applications with enhanced security and trust guarantees. However, the joint resource allocation for task offloading and blockchain services has been insufficiently investigated in existing works. To address this gap, this paper proposes a framework for jointly allocating resources of blockchain, users’ virtualized services, and Mobile Edge Computing (MEC) task assignment in Vehicular Fog Computing (VFC) networks. Specifically, we formulate the optimization problem as an integer nonlinear programming model aiming to maximize the satisfaction rate of users’ service requests while minimizing the corresponding blockchain operation time under mobility, queuing, instantiation, and resource constraints. To solve it in a timely manner, we design two-stage hierarchical low-complexity solutions, namely a Particle Swarm Optimization-based Joint Blockchain-enabled Service placement and Task Assignment algorithm (PSO-JBSTA), and a Genetic Algorithm-based approach (GA-JBSTA). Through extensive simulations, we demonstrate the effectiveness of PSO-JBSTA (resp. GA-JBSTA) and their adaptability to network conditions, achieving an average 35% (resp. 24%) improvement in users’ service satisfaction rate and 9.5% (resp. 10.2%) reduction in average blockchain validation delay compared with the baselines. | 10.1109/TNSM.2026.3737068 |
| Jian Ye, Gaolei Fei, Jiajie Li, Xuemeng Zhai, Guangmin Hu, Ming Liang | Network topology inference via time-frequency consistency analysis of end-to-end traffic time series | 2026 | Early Access | Timing Topology Measurement Probes Frequency Modeling Trees (botanical) Vegetation Joining processes Tomography Network topology inference network tomography time-frequency consistency contrastive learning | In this paper, we study the classical network tomography problem of tree topology inference using end-to-end measurement. Traditional methods rely on time series correlations to measure shared path lengths. However, time-varying and non-stationary background traffic often biases these measurements. To overcome this, we comprehensively explore end-to-end traffic time series via time-frequency consistency analysis. Specifically, we jointly characterize time series in both time and frequency domains, imposing a consistency constraint. This ensures embeddings of the same time series across domains remain close in the latent space, providing a robust description of traffic dynamics. Our contrastive learning approach effectively highlights similarities among flows on common paths and distinguishes those on disjoint paths, thereby mitigating background traffic interference. Extensive evaluations across widely used probing strategies and metrics demonstrate that our embedding significantly enhances time series correlation and accurately measures shared paths. | 10.1109/TNSM.2026.3749558 |
| Rosario Patanè | Dynamic Coalition Formation Under Capacity Constraints: A Regime-Switching Value-Investing Game | 2026 | Early Access | Games Modeling Resource management Seeds (agriculture) Gain Service level agreements Pricing Internet of Things Terminology Investment Edge computing network service management coalition formation resource allocation Shapley value audit mechanisms | Edge computing service deployment requires the Network Operator (NO) and Service Providers (SPs) to coordinate investment and resource allocation under uncertain demand. This paper develops an audit-based service management framework for daily coalition formation with fixed capacity and service-level agreement (SLA) reservations. A two-stage coalitional game separates infrastructure investment from operational participation. Demand follows a Geometric Random Walk (GRW), and SPs apply an ordered admission and suspension rule using reported marginal contributions. With the NO held fixed, the operational coalition value is submodular; mandatory reservations can produce negative Shapley payoffs. We derive a separable benchmark, compute operational Shapley allocations, and give a sufficient condition for convergence to an individual equilibrium. A probabilistic audit mechanism provides a conditional daily truthfulness guarantee under verified settlement and enforceable penalties. For five service classes over three years, the reference run gains 12.4% over static grand-coalition membership and recovers 94.6% of the full-information optimum. Across 30 runs, the median gain is 13.3%. Sensitivity tests examine policy parameters, capacity and alternative demand models. The gain depends on capacity and update order; abundant capacity can make the admission rule underperform static membership. | 10.1109/TNSM.2026.3750592 |
| Diogo Pereira, Rodolfo Oliveira, Daniel Benevides Da Costa, Hyong Kim | Performance Assessment of Beamforming Training Protocols in IEEE 802.11ad/ay Networks | 2026 | Early Access | Modeling Probability Media Access Control Nickel Simulation Array signal processing Training Timing Protocols Standards Decentralized Beam Training MAC Performance Evaluation IEEE 802.11ad IEEE 802.11ay | This paper introduces an innovative two-step methodology to model the beamforming training (BFT) medium access control (MAC) behavior of IEEE 802.11ad and IEEE 802.11ay networks, capturing several MAC-layer features specified in the standards that previous work has not considered. The proposed framework jointly employs two discrete-time Markov chains (DTMCs): the first models the individual behavior of each transmitting station (STA), including the dynamic adjustment of the competing STA to account for the idle period, while the second captures the network-wide interactions of all STAs and uses this information to derive the medium access probability at each frame slot during the BFT process. This work introduces two key novel modeling assumptions: (1) the STAs cease access once they successfully access a BFT frame’s slot, and (2) the number of competing STAs dynamically decreases as they enter the idle period after a given number of consecutive collisions, providing a precise representation of BFT MAC operation in IEEE 802.11ad and IEEE 802.11ay standards. We derive the theoretical expressions for the expected number of idle STAs based on probabilities of successful BFT, collisions, and transitions to the idle period.We validate the model’s accuracy through Monte Carlo simulations across diverse network scenarios, showing close alignment with simulation results and improved accuracy over prior models that do not consider these two modeling assumptions. Additionally, we analyze the impact of the collision threshold and idle period duration on BFT goodput, highlighting the model’s ability to compute MAC protocol performance. | 10.1109/TNSM.2026.3751488 |
| Vincent Sheh, Yao Chiang, Hung-Yu Wei | Two-Timescale Service Orchestration for Dependable Multi-Region Edge Analytics under Adversarial Workloads | 2026 | Early Access | Modeling Delays Routing Costing Inspection Central Processing Unit Receivers Signal detection Degradation Accuracy Edge computing resource management task offloading intrusion detection systems Yo-Yo attacks multi-agent reinforcement learning | Adversarial workloads can saturate the shared CPU budget of edge nodes, undermining the continuous availability that safety-critical analytics require. Co-locating an inline intrusion detection system (IDS) can filter malicious traffic but creates contention with analytics inference over the same budget, producing a defense-service resource tradeoff. This tradeoff is destabilized by two mechanisms: adaptive Yo-Yo attacks that exploit container scaling delay, and load-based offloading that ignores cross-region IDS mismatch. We propose a two-timescale orchestration framework that jointly minimizes service-level objective (SLO) violations, residual malicious leakage, and benign quality degradation. A long-timescale multi-agent reinforcement learning policy partitions CPU between inspection and inference, internalizing scaling delay and coordinating across regions to suppress oscillatory reallocation. A short-timescale heuristic routes inspection traffic to receivers with compatible detection models, preventing the mismatched-IDS errors that load-based routing would induce. Compared with a representative state-of-the-art baseline, the framework achieves up to 68.8% lower SLO violation rate, 90.9% lower residual malicious leakage, and 64.6% fewer reallocations. | 10.1109/TNSM.2026.3753027 |