Computer Networks最新文献

{"title":"LCA: Deep Reinforcement Learning-Based Congestion Avoidance Routing Model in SDN","authors":"Lizeth P. Aguirre S.,&nbsp;Yao Shen,&nbsp;Minyi Guo","doi":"10.1016/j.comnet.2025.111371","DOIUrl":"10.1016/j.comnet.2025.111371","url":null,"abstract":"<div><div>With the rapid advancement of network technologies, ensuring optimal performance across diverse applications has become increasingly challenging, particularly regarding latency and throughput. Treating online video streaming and file transfers equally can lead to congestion and inefficient resource utilization. The real-time optimization of forwarding paths for traffic flows with varying QoS requirements remains inadequately addressed. Traditional algorithms often struggle with congestion control, as they operate independently of routing protocols, making them inflexible and difficult to adjust. To overcome these challenges, we propose LCA, a Deep Reinforcement Learning-based Congestion Avoidance Routing Model for SDN. LCA dynamically adapts to diverse application needs using a sophisticated reward function to optimize routing and ensure differentiated QoS guarantees. To enhance adaptability and reliability, we introduce a Fast-Secure Validation mechanism that prevents unsafe routes, ensuring rapid convergence and reducing management overhead. LCA also integrates a congestion severity index to assess congestion levels and prevent network collapse, along with a quality of experience factor to maintain QoS. Additionally, LCA incorporates a traffic classification phase to differentiate mice-elephant flows, assigning appropriate queues to meet class-of-service requirements. Implemented within a RYU-Docker-based SDN architecture, LCA features a Live-QoS Monitor and DNC Classifier, addressing real-time traffic demands across ten service classes. Performance evaluations demonstrate that LCA outperforms state-of-the-art algorithms, achieving 5%–10% lower delay, 5%–20% lower packet loss, and 25%–30% reduced jitter under congestion. These results highlight LCA’s effectiveness in ensuring QoS, making it a promising solution for modern SDN environments.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"268 ","pages":"Article 111371"},"PeriodicalIF":4.4,"publicationDate":"2025-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144168729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Age of information-aware trajectory optimization for time-sensitive UAV systems in uplink SCMA networks","authors":"Teshager Hailemariam Moges ,&nbsp;Thanh Phung Truong ,&nbsp;Demeke Shumeye Lakew ,&nbsp;Thien Ho Huong ,&nbsp;Vinh Truong Hoang ,&nbsp;Nhu-Ngoc Dao ,&nbsp;Sungrae Cho","doi":"10.1016/j.comnet.2025.111369","DOIUrl":"10.1016/j.comnet.2025.111369","url":null,"abstract":"<div><div>Optimizing the Age of Information (AoI) and minimizing mission time are pivotal in uncrewed aerial vehicle (UAV)-assisted Internet of Things (IoT) systems to maintain data freshness for time-sensitive applications, particularly in dynamic mobile environments. This paper tackles these objectives in sparse code multiple access (SCMA) networks, a potential access technology for sixth-generation IoT communications. In particular, we optimized UAV trajectory by jointly considering AoI and mission time reductions along with time-critical constraints. Accounting for the dynamic and evolving interactions between IoT devices and UAVs, we modeled the optimization problem as a Markov decision process and resolved it by a deep deterministic policy gradient-based dynamic hovering point selection algorithm (DDPG-DHPSA). Our approach especially manages current AoIs and data volumes to dynamically determine the optimal hovering point sequence forming the UAV trajectory. Simulation results demonstrated that our solution reduces AoI and mission time by approximately 87% and 73%, respectively, outperforming recent benchmarks.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"268 ","pages":"Article 111369"},"PeriodicalIF":4.4,"publicationDate":"2025-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144139221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Federated learning-based anomaly detection for zero-day attack prevention in 6G network slices","authors":"Iftikhar Rasheed ,&nbsp;Hala Mostafa","doi":"10.1016/j.comnet.2025.111376","DOIUrl":"10.1016/j.comnet.2025.111376","url":null,"abstract":"<div><div>The emergence of 6G networks introduces unprecedented security challenges in network slicing, particularly in detecting and preventing zero-day attacks while preserving data privacy across distributed network environments. This paper presents a novel federated learning framework that integrates adaptive feature extraction with privacy-preserving mechanisms for real-time anomaly detection in network slices. Our approach combines hierarchical anomaly detection with transfer learning capabilities to enable collaborative threat detection while maintaining data locality and minimizing communication overhead. Experimental results demonstrate superior performance with a 97.2% detection rate for zero-day attacks, a 42% reduction in computational overhead, and effective privacy preservation through differential privacy mechanisms that maintain an <span><math><mi>ϵ</mi></math></span>-privacy bound of 1.2. The proposed framework scales linearly up to 1000 concurrent network slices while maintaining an average detection latency of 47ms, significantly outperforming existing approaches in both accuracy and efficiency. These results establish a robust foundation for securing future 6G network slices against emerging threats while addressing the critical challenges of privacy preservation and real-time response requirements.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"268 ","pages":"Article 111376"},"PeriodicalIF":4.4,"publicationDate":"2025-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144139223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Forensic investigation of vehicle-related data in Android phones connected to In-Vehicle Infotainment systems","authors":"Seongbin Cho ,&nbsp;Hojun Seong ,&nbsp;Haein Kang ,&nbsp;Seong-je Cho ,&nbsp;BooJoong Kang","doi":"10.1016/j.comnet.2025.111370","DOIUrl":"10.1016/j.comnet.2025.111370","url":null,"abstract":"<div><div>As modern vehicles are popularly equipped with an In-Vehicle Infotainment (IVI) system, many drivers use the IVI system which provides various infotainment services to them while driving. In general, after connecting a driver’s smartphone to the IVI system via Bluetooth, WiFi, or USB, she or he can make phone calls, use short message service (SMS), perform media playback, and utilize navigation functions of the smartphone. As a result, various vehicle-related data can be stored in the smartphone linked to the IVI system. Therefore, it is possible to obtain digital evidence through forensic investigation of the smartphone if a suspect has used his or her smartphone while connected to a vehicle’s IVI system. In this paper, we propose a new forensic technique to collect and analyze Android log messages as well as Bluetooth HCI snoop log left on Android phones which have interacted with vehicles’ IVI system via Bluetooth. The Android log messages are stored in multiple circular buffers kept by the Android logging system. The Bluetooth HCI snoop log, a type of log file, is a record of all Host Controller Interface (HCI) commands and events transmitted through Bluetooth on an Android device. From the two forensic data sources, we have identified lots of digital artifacts including as MAC address of the connected vehicle, the vehicle information, the time when being connected and disconnected to a vehicle, phone call history, etc. We also analyze the differences of digital artifacts obtained from the Android log messages and the Bluetooth HCI packets. We finally construct a timeline of the examined driver’s behaviors and vehicle events in terms of vehicle forensics.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"268 ","pages":"Article 111370"},"PeriodicalIF":4.4,"publicationDate":"2025-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144147629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"RLFE-IDS: A framework of Intrusion Detection System based on Retrieval Augmented Generation and Large Language Model","authors":"Xuewei Li ,&nbsp;Zengyang Zheng ,&nbsp;Mankun Zhao ,&nbsp;Yue Zhao ,&nbsp;Lifeng Shi ,&nbsp;Baoliang Wang","doi":"10.1016/j.comnet.2025.111341","DOIUrl":"10.1016/j.comnet.2025.111341","url":null,"abstract":"<div><div>Intrusion Detection Systems (IDS) play a critical role in network security as a key defense measure, often struggle to effectively handle unknown attacks or variations of known attacks. This challenge is exacerbated by the poor generalization of deep learning models. To enhance the adaptability of IDS, this article introduces an innovative framework called LLM-IDS, which explores the feasibility of leveraging Large Language Model (LLMs) for intrusion detection, due to its strong generalization capabilities. However, there is a significant difficulty in deploying LLMs. Moreover, since most LLMs are primarily designed for Natural Language Processing (NLP) tasks, significant differences arise when naively adapting them to intrusion detection tasks. To address them, this article introduces a novel framework called RLFE-IDS, comprising two key modules: Retrieval-Augmented Generation (RAG) and an embedding model called FE-Net. RAG employs a vector database to store network data alongside their corresponding vector representations. Based on the RAG framework, LLMs can be directly called through an Application Programming Interface (API), alleviating the difficulties in its deployment. The embedding model FE-Net, bridges the semantic gap between text data and network data. Upon receiving new network data, RLFE-IDS employs RAG to query the database for the most relevant network data, which is then fed into the LLM to classify. This article validates approach through experiments on four datasets, and deploys RLFE-IDS into the real network environment. Experiments show that the optimal accuracy of LLM-IDS is 99.36%, and that of RLFE-Net is 98.56%. The results demonstrate not only the feasibility of applying LLMs to intrusion detection, but also the robustness and superior performance of RLFE-IDS.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"268 ","pages":"Article 111341"},"PeriodicalIF":4.4,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144139222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Vehicular Cloud Computing: A cost-effective alternative to Edge Computing in 5G networks","authors":"Rosario Patanè ,&nbsp;Nadjib Achir ,&nbsp;Andrea Araldo ,&nbsp;Lila Boukhatem","doi":"10.1016/j.comnet.2025.111365","DOIUrl":"10.1016/j.comnet.2025.111365","url":null,"abstract":"<div><div>Edge Computing (EC) is a computational paradigm that involves deploying resources such as CPUs and GPUs near end-users, enabling low-latency applications like augmented reality and real-time gaming. However, deploying and maintaining a vast network of EC nodes is costly, which can explain its limited deployment today. A new paradigm called Vehicular Cloud Computing (VCC) has emerged and inspired interest among researchers and industry. VCC opportunistically utilizes existing and idle vehicular computational resources for external task offloading.</div><div>This work is the first to systematically address the following question: <em>Can VCC replace EC for low-latency applications?</em> Answering this question is highly relevant for Network Operators (NOs), as VCC could eliminate costs associated with EC given that it requires no infrastructural investment. Despite its potential, no systematic study has yet explored the conditions under which VCC can effectively support low-latency applications without relying on EC. This work aims to fill that gap.</div><div>Extensive simulations allow for assessing the crucial scenario factors that determine when this EC-to-VCC substitution is feasible. Considered factors are load, vehicles mobility and density, and availability. Potential for substitution is assessed based on multiple criteria, such as latency, task completion success, and cost. Vehicle mobility is simulated in SUMO, and communication in NS3 5G-LENA. The findings show that VCC can effectively replace EC for low-latency applications, except in extreme cases when the EC is still required (latency <span><math><mrow><mo>&lt;</mo><mn>16</mn><mspace></mspace><mi>ms</mi></mrow></math></span>).</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"268 ","pages":"Article 111365"},"PeriodicalIF":4.4,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144168728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Adaptive traffic engineering with segment routing through deep reinforcement learning","authors":"Ying Tian ,&nbsp;Zhiliang Wang ,&nbsp;Xia Yin ,&nbsp;Xingang Shi ,&nbsp;Jiahai Yang ,&nbsp;Han Zhang","doi":"10.1016/j.comnet.2025.111356","DOIUrl":"10.1016/j.comnet.2025.111356","url":null,"abstract":"<div><div>Segment Routing (SR) is a source routing technique that has been widely used in Traffic Engineering (TE) because of its scalability and flexibility. Despite extensive research on Traffic Engineering with Segment Routing (SR-TE) in recent years, online SR-TE still encounters challenges such as the absence of real-time traffic matrices (TMs), slow online decision speed, and unsatisfactory TE performance. Although TE with Reinforcement Learning (RL) may obviate the need for real-time TMs in online TE, existing studies struggle to handle the vast number of candidate routing plans introduced by SR-TE, as well as have significant training overhead. In this paper, we propose an online adaptive SR-TE algorithm named Adpt-SRTE. With the help of deep reinforcement learning (DRL), Adpt-SRTE is first trained with pre-collected historical TMs, and then provides SR routing configuration for new TMs online when only real-time link utilization is known. To deal with the massive number of candidate routing plans, Adpt-SRTE strategically combines the Proximal Policy Optimization (PPO) algorithm with action branching architecture. Besides, appropriate training methods are used to improve TE performance and reduce training overhead. Experimental results demonstrate that Adpt-SRTE can achieve good TE performance for both short and long time scale up to weeks, reducing the maximum link utilization by up to 33%. Besides, it has low offline training overhead, short online decision time and low path configuration overhead.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"267 ","pages":"Article 111356"},"PeriodicalIF":4.4,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144116749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Joint routing, band, and spectrum assignment in C+L band elastic optical networks towards ultra-broadband era","authors":"Weichang Zheng ,&nbsp;Mingcong Yang ,&nbsp;Yu Zheng ,&nbsp;Yongbing Zhang ,&nbsp;Kun Yang","doi":"10.1016/j.comnet.2025.111373","DOIUrl":"10.1016/j.comnet.2025.111373","url":null,"abstract":"<div><div>The rapid growth in Internet traffic is pushing single-fiber capacity closer to its Shannon limit, highlighting the need for advancements in optical communication technologies. Elastic Optical Networks (EONs) have emerged as a promising solution to improve spectral efficiency. Another method to expand capacity is by using both C and L bands, instead of relying solely on the C band, thereby expanding the available spectrum. However, the introduction of new transmission technologies and the expansion of spectrum resources necessitate operators to re-plan networks in a cost-effective manner. In this paper, we propose a two-layer network architecture that separates the C-band and L-band. Given that the optical parameters of these bands differ, it becomes essential to allocate routing and resources dynamically based on varying traffic demands. We define this problem as the Routing, Band, and Spectrum Assignment (RBSA) problem and prove its NP-hardness. To address it, we introduce an Integer Linear Programming (ILP) model aimed at minimizing capital expenditure (CAPEX), along with a heuristic algorithm for large-scale instances. Simulation experiments using different sizes of service request matrices on two network topologies demonstrate the effectiveness of both the ILP model and the heuristic algorithm. To the best of our knowledge, this is the first work that addresses the RBSA problem in C+L band EONs.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"267 ","pages":"Article 111373"},"PeriodicalIF":4.4,"publicationDate":"2025-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144107451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Improving the performance of Dragonfly networks through restrictive Proxy routing strategies","authors":"Javier Navaridas,&nbsp;Jose A. Pascual","doi":"10.1016/j.comnet.2025.111334","DOIUrl":"10.1016/j.comnet.2025.111334","url":null,"abstract":"<div><div>Dragonfly has become the network of choice for large-scale high-performance computing systems and, indeed, it dominates the top positions of supercomputer rankings. The reason for this is that it offers a sweet spot in terms of cost, simplicity, performance, fault-tolerance and power consumption. In this work, we propose a collection of routing strategies which restrict proxies to be adjacent to either the local or the remote router. This way, it features shorter paths than the standard Valiant routing. We carry out an extensive simulation-based evaluation to assess their performance. Our experiments found latency reductions of up to 76% and throughput improvements of up to 26% when compared with standard Valiant routing when using synthetic traffic from independent sources at different scales. Furthermore, when using realistic application-inspired workloads, we found the strategies required between 5% and 20% less time to perform communications. In general, we observe that selecting proxies that are adjacent to the sender is more beneficial than those adjacent to the destination because the latter tends to generate backpressure in the last level of the interconnect. Interestingly, we found that the most restrictive proxy routing strategies obtain the best results in all scenarios and show that counterintuitively, the lower the path diversity, the more balanced the use of network resources. Our study includes investigating the interplay between routing and Dragonfly parameters and provide optimal parameters for proxy-based routing algorithms. Finally, we discuss some practical considerations related to the deployment of our strategies.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"267 ","pages":"Article 111334"},"PeriodicalIF":4.4,"publicationDate":"2025-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144116177","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Hybrid Quantum-Safe integration of TLS in SDN networks","authors":"Jaime S. Buruaga ,&nbsp;Ruben B. Méndez ,&nbsp;Juan P. Brito ,&nbsp;Vicente Martin","doi":"10.1016/j.comnet.2025.111355","DOIUrl":"10.1016/j.comnet.2025.111355","url":null,"abstract":"<div><div>Shor’s algorithm efficiently solves factoring and discrete logarithm problems using quantum computers, compromising all public key schemes used today. Algorithms such as RSA, DHKE, and ECC will not work in a world with quantum computers, since they can easily invert the functions that provide their computational strength in the classical world. These schemes rely on assumptions on their computational complexity, which quantum computers can easily bypass. The solutions have to come from new algorithms – called Post-Quantum Cryptography (PQC) – or from new methods, such as Quantum Key Distribution (QKD). The former replicate the computational security ideas of classical public key algorithms, while the latter recurs to use the quantum properties of nature, which also brings a mathematical security proof, potentially offering Information-Theoretic Security. To secure data in the future, we must adopt these paradigms. With the speed of quantum computing advancements, the transition to quantum-safe cryptography within the next decade is critical. Delays could expose long-lived confidential data, as current encryption may be broken before its value expires. However, the shift must balance the adoption of new technologies with maintaining proven systems to protect against present and future threats. In this work, we have selected Transport Layer Security (TLS), one of the most widely used protocols, as the foundation to hybridize classical, quantum, and post-quantum cryptography in a way suitable for broad adoption in Software-Defined Networking (SDN), the most flexible networking paradigm that has been used to deploy integrated quantum–classical networks. To this end, we use standards for QKD key extraction and SDN integration. The purposed implementation is based on the latest version of TLS (1.3) and demonstrates advanced capabilities such as rekeying and key transport across a large QKD network, while supporting crypto-agility and maintaining backward compatibility through the use of ciphersuites. The performance of this approach has been demonstrated using a deployed production infrastructure.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"267 ","pages":"Article 111355"},"PeriodicalIF":4.4,"publicationDate":"2025-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144107452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}