Last updated: 2026-11-19 05:01 UTC
All documents
Number of pages: 179
| Author(s) | Title | Year | Publication | Keywords | ||
|---|---|---|---|---|---|---|
| Ling Hu, Tao Yang, Yu Pang, Xionglve Li, Bingnan Hou, Zhiping Cai | Grey Rhino Warning: Reflection Amplification Attacks in IPv6 Cannot Be Ignored | 2026 | Early Access | Reflection Amplifiers Measurement Probes Conferences Internet Servers IP networks Security Computers reflection amplification ISAV IPv6 security | Distributed Denial-of-Service (DDoS) attacks represent a cost-effective and potent threat to network stability. While extensively studied in IPv4 networks, DDoS implications in IPv6 remain underexplored. The vast IPv6 address space renders brute-force scanning of all active addresses followed by individual amplifier testing impractical. Innovatively, this work investigates AS-level vulnerabilities to reflection amplification attacks in IPv6. One prerequisite for amplification presence is that it is located in a vulnerable autonomous system (AS) without inbound source address validation (ISAV) deployment. Hence, the analysis focuses on two critical aspects: global detection of ISAV deployment and identification of amplifiers within vulnerable ASes. Specifically, we develop a framework named RhinoV6, combining ICMP Time Exceeded mechanisms for AS-level ISAV detection, employing recursive IPv6 address scanning for identifying candidate reflectors, and utilizing dual vantage points to verify the presence of practical amplifiers. This hierarchical approach demonstrates that ASes lacking ISAV are indeed vulnerable to reflection amplification attacks. Experimental results reveal that 4,460 ASes (61.36% of measured networks) lack ISAV deployment. Through scanning approximately 47M active addresses, we have identified reflection amplifiers in 3,507 ASes. Furthermore, we measure and analyze the implications of these amplifiers. This demonstrates that current IPv6 networks are fertile ground for reflection amplification attacks. We also provide potential mitigation measures. | 10.1109/TNSM.2026.3754141 |
| Franck Messaoudi, Luhan Wang, Abdelkader Mekrache, Adlen Ksentini, Bingxuan Li, Jialei Su, Sofiane Messaoudi, Salim El Ghalbzouri | The Brewing Storm in 5G’s Data Plane: Design and Evaluation of a High-Performance eBPF/XDP-Based User Plane Function | 2026 | Early Access | Quality of service Fluid flow Kernel Information rates Throughput Planing 5G mobile communication Linux Filtering Filters 5 th Generation Mobile Networks (5G) User Plane Function (UPF) QoS Enforcement Rule (QER) Quality of Service (QoS) extended Berkeley Packet Filter (eBPF) eXpress Data Path (XDP) Traffic Control (tc) Queuing Discipline (qdisc) | This paper presents the design and implementation of a novel 5G UPF leveraging eBPF technology to meet the stringent performance and programmability requirements of emerging 6G systems. Traditional UPF implementations often struggle to balance performance, flexibility, and resource efficiency-challenges particularly critical in CPU- and I/O-constrained edge environments. The proposed eBPF-based UPF architecture mitigates these limitations by embedding core functionalities, such as packet classification, forwarding, and QoS enforcement, directly within the Linux kernel via eBPF programs attached through XDP and tc hook points. Performance evaluation using TRex demonstrates that the proposed solution achieves competitive throughput, low packet loss, and efficient CPU utilization across traffic profiles. Moreover, it maintains full compliance with 5G Core Network standards. Comparative analysis with well-established open-source UPF implementations further underscores its advantages. This work highlights the potential of eBPF as a foundational technology for building next-generation, programmable UPFs optimized for edge cloud deployments in the 6G era. | 10.1109/TNSM.2026.3720812 |
| 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 |
| Byungchang Kim, Shinyoung Lue, Seonyeong Hwang, Youhee Park, Yeji Lee, Jaemin Jeong, Peter Bloodsworth, Euiseok Hwang | GRIDS: Generalized Representation-based Intrusion Detection System via Federated Contrastive Learning | 2026 | Early Access | Modeling Labeling Intrusion detection Training Federated learning Fluid flow Internet of Things Contrastive learning Artificial intelligence Signal detection Intrusion detection system federated learning contrastive learning anomaly detection network security transformer encoder | Existing AI-based intrusion detection systems are typically trained for specific network environments, leading to significant performance degradation when deployed in different settings or exposed to evolving attack strategies. We propose GRIDS (Generalized Representation-based Intrusion Detection System), a federated contrastive learning framework for cross-environment intrusion detection that keeps raw traffic data local. GRIDS employs a Transformer-based encoder trained with supervised contrastive learning across distributed network environments, learning a shared representation without exchanging sensitive traffic data. The encoder embeds network flow features into a latent space where semantically similar traffic patterns cluster together, enabling effective anomaly detection via k-nearest neighbor scoring. Evaluated on four heterogeneous NetFlow datasets, GRIDS outperforms existing federated IDS baselines on average with a single unified model. In leave-one-out cross-validation, a substantial portion of the detection capability of GRIDS transfers to network environments unseen during training, and the level of transfer varies across target networks. Deployment at such a network requires no labeled attack data or fine-tuning. It uses the benign traffic of the network as the kNN reference set and its unlabeled traffic for normalization and threshold calibration. The framework targets deployments in which a single model protects multiple heterogeneous networks. | 10.1109/TNSM.2026.3748922 |
| Pengbo Li, Xingwei Wang, Hao Lu, Qiang He, Donghong Han, Saru Kumari, Keqin Li, Sajal K. Das | FedC3P: Compatibility Cost Sharing and Congestion-Aware Posted Pricing for Heterogeneous Multi-Cloud Federations | 2026 | Early Access | Resource management Clouds Costing Pricing Investment Optimization Modeling Routing Delays Virtual machines Cloud federation compatibility investment congestion-aware posted pricing cost sharing provider participation resource allocation | Heterogeneous multi-cloud federations pool resources across providers. Compatibility investment reduces service costs caused by incompatibility, but returns depend on workload allocation under capacity and congestion. Existing allocation and pricing studies generally fix compatibility, leaving investment and cost sharing undetermined. We propose a mechanism for compatibility cost sharing and congestion-aware posted pricing in heterogeneous multi-cloud federations (FedC3P). FedC3P updates compatibility investment across providers on the slower time scale and allocates elastic workloads on the faster time scale. For fixed investment, FedC3P maximizes federation welfare subject to demand and regional capacity constraints and derives resource prices from optimality conditions. Given these prices and service costs from incomplete compatibility, independent service quantity and routing decisions by workload classes implement the welfare-maximizing allocation. FedC3P then shares compatibility costs, checks the feasibility of provider participation under budget balance, and determines provider payoffs through weighted Nash bargaining when distributable surplus is positive. We establish an O(T−1/2) saddle-gap bound for inner averages over T iterations and first-order stationarity of every outer accumulation point under sufficient conditions. At the default setting, semi-synthetic experiments on 277 cloud-region records show welfare gains of 18.9% and 30.8% over Routing-NUM and TD3-Routing; median runtime remains below 5 s at the largest scales. | 10.1109/TNSM.2026.3754272 |
| Wuzhao Li, Weian Guo | Switch-Coupled Scheduling for Energy-Bounded Heterogeneous Edge AI on Commodity Ethernet | 2026 | Early Access | Energy Modeling Joining processes Timing Poles and zeros Dispatching Windows Loading Scheduling Management edge AI energy-constrained scheduling Ethernet switching Lyapunov optimization serverless computing multi-tenancy | Heterogeneous edge-AI clusters behind commodity Ethernet must jointly manage compute queues, shared links, runtime residency, and energy budgets. We formulate request admission and assignment with per-hop FCFS resources, byte-limited TTL–LRU caches, temperature-dependent service, power uncertainty, deadlines, and tenant shares. Switch-Coupled Dual Scheduling (SCD) combines deadline feasibility, cost-aware energy credits, and device plus tenant virtual debts. Analysis establishes restricted-problem hardness, a state-correct finite-horizon certificate, and guarded commitment bounds. Nominal trace-driven simulations show higher offered on-time success and lower mean response than compute-first. These gains accompany higher task energy, admitted tail latency, and mean peak age of information. The success gain over matched drift-plus-penalty scheduling is incremental. Shared link state limits queue escalation under severe simulated bottlenecks. Elastic tenant allocation restores service under tight budgets while retaining device commitment bounds. Repeated hardware experiments compare scheduling under common resource constraints, execute trained neural and tree models on heterogeneous boards, and measure Ethernet path contention. The results support competitive deadline-oriented control with explicit service and energy trade-offs. | 10.1109/TNSM.2026.3752827 |
| 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 |
| Deemah H. Tashman, Soumaya Cherkaoui | Trustworthy AI-Driven Dynamic Hybrid RIS: Joint Optimization and Reward Poisoning-Resilient Control in Cognitive MISO Networks | 2026 | Early Access | Reconfigurable intelligent surfaces Reliability Optimization Security MISO Array signal processing Vectors Satellites Reflection Interference Beamforming cascaded channels cognitive radio networks deep reinforcement learning dynamic hybrid reconfigurable intelligent surfaces energy harvesting poisoning attacks | Cognitive radio networks (CRNs) are a key mechanism for alleviating spectrum scarcity by enabling secondary users (SUs) to opportunistically access licensed frequency bands without harmful interference to primary users (PUs). To address unreliable direct SU links and energy constraints common in next-generation wireless networks, this work introduces an adaptive, energy-aware hybrid reconfigurable intelligent surface (RIS) for underlay multiple-input single-output (MISO) CRNs. Distinct from prior approaches relying on static RIS architectures, our proposed RIS dynamically alternates between passive and active operation modes in real time according to harvested energy availability. We also model our scenario under practical hardware impairments and cascaded fading channels. We formulate and solve a joint transmit beamforming and RIS phase optimization problem via the soft actor-critic (SAC) deep reinforcement learning (DRL) method, leveraging its robustness in continuous and highly dynamic environments. Notably, we conduct the first systematic study of reward poisoning attacks on DRL agents in RIS-enhanced CRNs, and propose a lightweight, real-time defense based on reward clipping and statistical anomaly filtering. Numerical results demonstrate that the SAC-based approach consistently outperforms established DRL base-lines, and that the dynamic hybrid RIS strikes a superior trade-off between throughput and energy consumption compared to fully passive and fully active alternatives. We further show the effectiveness of our defense in maintaining SU performance even under adversarial conditions. Our results advance the practical and secure deployment of RIS-assisted CRNs, and highlight crucial design insights for energy-constrained wireless systems. | 10.1109/TNSM.2026.3660728 |
| 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 |
| Gustavo Z. Bruno, Gabriel M. Almeida, Aloízio Da Silva, Luiz A. DaSilva, Joao F. Santos, Alexandre Huff, Kleber V. Cardoso, Cristiano B. Both | Towards Energy- and QoS-aware Load Balancing for 5G Advanced: Leveraging O-RAN to Achieve Sustainability and Energy Efficiency | 2026 | Early Access | Open RAN Modeling Timing Energy Energy efficiency Optimization Handover Cells (biology) Energy conservation Quality of service O-RAN RIC 5G Advanced Energy Efficiency Dynamic Demand Resource Management | The increasing energy consumption of next-generation mobile networks necessitates the adoption of autonomous and energy-aware management strategies. This article proposes a novel adaptive solution leveraging the Open Radio Access Network (O-RAN) architecture to optimize energy efficiency while maintaining Quality of Service (QoS). The proposed approach introduces a hierarchical O-RAN-aligned control framework in which a Non-Real-Time RAN Intelligent Controller (Non-RT RIC) periodically computes energy-aware policies from long-term historical data, while a Near-Real-Time RIC enforces those policies through per-User Equipment (UE) handover actions on a sub-second timescale. We formulate a joint energy- and QoS-aware load balancing problem as a Mixed-Integer Non-Linear Programming (MINLP) model. This model optimizes UE association across E2 Nodes to minimize transmission power and autonomously deactivate underutilized cells, while satisfying strict QoS constraints. To validate the proposed solution, we deploy it in an experimental environment that simulates massive sports events. Experimental results demonstrate 72% energy savings over a 24-hour trace and sub-second handover delays (0.123–0.204 s/UE), confirming the solution’s feasibility for autonomous and sustainable 5G Advanced networks. This work provides guidelines for deploying energy-efficient strategies in O-RAN environments and underscores the potential of adaptive solutions for sustainable mobile communications. | 10.1109/TNSM.2026.3751565 |
| Shengye Gong, Hui Yang, Qiuyan Yao, Xin Li, Tiankuo Yu, Wenxin Liu, Yang Zhao, Yucong Liu, Jie Zhang, Mohamed Cheriet | Resilient Hierarchical Polyhedron-based Configuration Protection for Large-Scale Multi-Domain Optical Networks | 2026 | Early Access | High performance computing Joining processes Protection Topology Costing Optical fiber networks Algorithms Modeling Architecture Computer architecture Network survivability multi-domain optical network network protection hierarchical polyhedron-based protection | Large-scale multi-domain optical networks are increasingly exposed to spatially correlated and concurrent failures, while monolithic pre-configured protection structures incur rapidly increasing global search complexity and protection-resource costs under heterogeneous physical constraints. To address this challenge, this paper proposes a resilient Hierarchical Polyhedron-based Configuration (HPC) architecture that decomposes a monolithic global survivability requirement into adaptive intra-domain connectivity constraints and a compact inter-domain connectivity constraint. To alleviate resource imbalance caused by topology-only network partitioning, a Topology-Resource Aware Domain Partitioning (TRADP) algorithm is developed to construct protection-supportable sub-domains by jointly considering topological structure and physical resource distribution. To avoid imposing a rigid protection level on heterogeneous domains, HPC assigns adaptive intra-domain connectivity targets according to local failure exposure and physical resource supportability. To reduce the complexity of cross-domain protection while preserving physical feasibility, a super-node abstraction and physical bridge-link mapping mechanism is employed to construct the inter-domain protection backbone under capacity, spectrum, and SRLG constraints. Extensive evaluations on networks of up to 1000 nodes and representative GEANT and NSFNET topologies demonstrate that HPC-TRADP maintains a recovery rate of 92.94% at 1000 nodes and 85.82% even when 30% of physical links fail concurrently. It further reduces protection overhead by up to 79.60% relative to p-KECS while maintaining efficient recovery paths, demonstrating a favorable balance between survivability, resource efficiency, and scalability. | 10.1109/TNSM.2026.3750417 |
| Hailong Cheng, Shi Ying, Xiaoyu Duan, Wanli Yuan | MTCNLog: A System Log Anomaly Detection Method with Fast Updates via Multi-Head TCN and Knowledge Distillation | 2026 | Early Access | Modeling Anomaly detection Training Sequences Sequential analysis Signal detection Timing Head Labeling Bit error rate Anomaly detection Knowledge distillation Temporal Convolutional Network (TCN) Data analysis Software engineering | Anomaly detection is essential for maintaining the stability and reliability of software systems. However, many automatic log anomaly detection methods rely primarily on template indexes and therefore discard semantic and parameter information that may be relevant to abnormal behavior. In addition, retraining a deployed detector from scratch can be costly when log distributions evolve. This paper proposes MTCNLog, a log anomaly detection method that combines a position-wise multi-head Temporal Convolutional Network (TCN) with a knowledge-distillation-based update strategy. MTCNLog first tokenizes raw logs using Byte-Level Byte Pair Encoding (BPE) and uses a BERT model adapted to the log domain to construct contextual representations of complete log entries. Attention pooling merges subword representations, and the multi-head TCN models temporal dependencies at different structural positions in a log sequence. For model updating, an early teacher snapshot initializes the student model, while a selective distillation loss transfers reliable historical knowledge. Experiments on HDFS, BGL, and Thunderbird show that MTCNLog achieves the highest F-measure among the evaluated methods under the adopted experimental protocol. Under the same validation-based rule, the complete update strategy also reaches stable performance in fewer epochs and requires less recurring detector-update time than the compared alternatives. | 10.1109/TNSM.2026.3752466 |
| Zhuo Li, Yunlong Xi, Hao Xun, Yu Zhang, Teng Liang, Kaihua Liu | Flesh: A flexible hybrid packet classification scheme with high performance | 2026 | Early Access | Trees (botanical) Vegetation Ports (computers) Timing Algorithms Electronics packaging Software defined networking Construction Decision trees Elementary particles Packet classification Software Defined Networking Particle swarm optimization Hash table | Packet classification is widely used in network infrastructure and is a key technology supporting security and other functions. Real-time network services require classification schemes to have extremely high classification performance. Meanwhile, Software Defined Networking (SDN) enables more flexible rule changes, so the performance of rule updates in classification schemes has also gradually attracted attention. The schemes based on hash table have emerged due to their excellent update performance. Among these schemes, multiple tuples and chains need to be accessed during the classification to match rules. However, an excessive number of tuples can degrade classification performance. Additionally, overly long chains can also degrade classification performance. To this end, a flexible hybrid scheme called Flesh is proposed. Specifically, a partitioning algorithm based on the particle swarm optimization algorithm (PSO-Partition) is designed to reduce the number of tuples and initially suppress the generation of long chains. In addition, a hybrid storage structure (H-Storage) is designed to further shorten long chains. Experimental results show that compared with advanced schemes PT-Tree, LearningTuple, and HHM, Flesh achieved 1.60x, 1.07x, and 1.19x classification performance, as well as 1.88x, 1.52x, and 1.46x update performance, respectively. In addition, Flesh is scalable, which enables packet classification and rule updates for the 12-field rule set. | 10.1109/TNSM.2026.3755136 |
| 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 |
| 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 |
| 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 |
| Hongyuan Cheng, Lihua Yin, Tianqing Zhu, Hongyu Yang, Dexin Zhu, Weixiang Jiang, Nan Wei | Pattern2Bot: A malicious server IP detection model based on self-trained heterogeneous graph neural network | 2026 | Early Access | Labeling Modeling Signal detection Training Botnet Servers IP networks Sequential analysis Conferences Security Botnet detection Self-supervised Graph neural network Command & Control service | Botnets play a key role in network attacks such as Distributed Denial-of-Service (DDoS) attacks, spamming and click fraud. Command & Control server is an important node for botmaster to control bots and distribute attack commands. Bot disguise as normal domain requests through DNS traffic, but leave malicious records in DNS logs containing client IP, query domain, server IP and other complex interactions. This information provides important clues for detecting those botnets. In the current study, researchers detect botnets through multiple perspectives, including abstracting DNS communication records into graphs and using graph neural network models for detection. Conventional approaches often necessitate massive labeled datasets for model training, which substantially incurs training costs. Moreover, despite enriching node embeddings via topological relations, graph models often suffer performance degradation when confronted with structural semantic obfuscation from evasion techniques like double-flux. In order to understand the abstract and complex relationship patterns in DNS records while reducing label usage to lower training costs, we propose a botnet Command & Control server detection model based on DNS traffic. This is a self-training heterogeneous graph neural network model that does not require a large number of labels. By integrating the high-order relational semantics derived from multiple meta-paths with the local topologies of target nodes, the model achieves finer-grained structural awareness and semantic abstraction, thereby enhancing detection performance. We validate the effectiveness of the model in a real dataset, and the results show that the model has a better understanding of the special structure possessed by the IPs of Command & Control servers. | 10.1109/TNSM.2026.3741111 |