Computer Networks最新文献

{"title":"Using spanners to improve network performance","authors":"Guy Rozenberg,&nbsp;Michael Segal","doi":"10.1016/j.comnet.2024.110976","DOIUrl":"10.1016/j.comnet.2024.110976","url":null,"abstract":"<div><div>In this paper we introduce a new, minimum-cuts based spanner algorithm, when the goal is twofold: (a) to decrease the number of active links in the network and (b) to maintain the ability of the SDN (Software-Defined Networking) controller to perform load balancing. The proposed spanner concept also can be used in order to reduce the running time of the SDN centralized routing algorithm. In addition, we show how to maintain the spanner under dynamic link insertion, deletion and changed weight. The validation of our solution is made through the analysis and simulation that show the superiority of our approach in many cases.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110976"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129385","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":"A comparative measurement study of cross-layer 5G performance under different mobility scenarios","authors":"Jiahai Hu ,&nbsp;Lin Wang ,&nbsp;Jing Wu ,&nbsp;Qiangyu Pei ,&nbsp;Fangming Liu ,&nbsp;Bo Li","doi":"10.1016/j.comnet.2024.110952","DOIUrl":"10.1016/j.comnet.2024.110952","url":null,"abstract":"<div><div>The 5G technology is expected to revolutionize various applications with stringent latency and throughput requirements, such as augmented reality and cloud gaming. Despite the rapid 5G deployment, it is still a puzzle whether current commercial 5G networks can meet the strict requirements and deliver the expected quality of experience (QoE) of these applications. Especially in mobile scenarios, as user mobility (e.g., walking and driving) plays a critical role in both network performance and application QoE, it becomes more challenging to provide high performance stably and continuously. To solve this puzzle, in this paper, we present a comprehensive cross-layer measurement study of current commercial 5G networks under five mobility scenarios typically seen in our daily lives. Specifically, under these mobility scenarios, we cover (1) the impact of physical layer metrics on network performance, (2) general network performance at the network layer, (3) comparison of four congestion control algorithms at the transport layer, and (4) application QoE at the application layer. Our measurement results show that the achievable network performance and application QoE under current commercial 5G networks falls behind expectations. We further reveal some insights that could be leveraged to improve the QoE of these applications under mobility scenarios.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110952"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129438","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 service caching, computation offloading and resource allocation for dual-layer aerial Internet of Things","authors":"Yue Zhang ,&nbsp;Zhenyu Na ,&nbsp;Zihao Wen ,&nbsp;Arumugam Nallanathan ,&nbsp;Weidang Lu","doi":"10.1016/j.comnet.2024.110974","DOIUrl":"10.1016/j.comnet.2024.110974","url":null,"abstract":"<div><div>The exponential growth of Internet of Things devices has triggered an unprecedented surge in mobile data traffic, posing significant challenges for latency-sensitive services. Mobile Edge Computing (MEC) has emerged as a promising solution by decentralizing computation and caching resources to the network edge. However, traditional terrestrial MEC systems struggle with limited coverage and flexibility. To overcome these issues, this paper proposes a novel dual-layer aerial MEC architecture, where multiple Unmanned Aerial Vehicles (UAVs) provide computation and caching support for resource-constrained terminal devices, and a high-altitude platform serves as a central hub for long-term service storage and retrieval. The system aims to minimize total latency by jointly optimizing service caching, task offloading, resource allocation, and 3D UAV deployment, formulated as a mixed-integer nonlinear programming problem and efficiently solved using an iterative algorithm based on linear relaxation and successive convex approximation. Simulation results demonstrate that the proposed scheme converges quickly across different scales and outperforms all baselines with minimal runtime increase, reducing total latency by 42.86% compared to the random UAV deployment.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110974"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129443","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":"Minimizing active nodes in MEC environments: A distributed learning-driven framework for application placement","authors":"Claudia Torres-Pérez ,&nbsp;Estefanía Coronado ,&nbsp;Cristina Cervelló-Pastor ,&nbsp;Javier Palomares ,&nbsp;Estela Carmona-Cejudo ,&nbsp;Muhammad Shuaib Siddiqui","doi":"10.1016/j.comnet.2024.111008","DOIUrl":"10.1016/j.comnet.2024.111008","url":null,"abstract":"<div><div>Application placement in Multi-Access Edge Computing (MEC) must adhere to service level agreements (SLAs), minimize energy consumption, and optimize metrics based on specific service requirements. In distributed MEC system environments, the placement problem also requires consideration of various types of applications with different entry distribution rates and requirements, and the incorporation of varying numbers of hosts to enable the development of a scalable system. One possible way to achieve these objectives is to minimize the number of active nodes in order to avoid resource fragmentation and unnecessary energy consumption. This paper presents a Distributed Deep Reinforcement Learning-based Capacity-Aware Application Placement (DDRL-CAAP) approach aimed at reducing the number of active nodes in a multi-MEC system scenario that is managed by several orchestrators. Internet of Things (IoT) and Extended Reality (XR) applications are considered in order to evaluate close-to-real-world environments via simulation and on a real testbed. The proposed design is scalable for different numbers of nodes, MEC systems, and vertical applications. The performance results show that DDRL-CAAP achieves an average improvement of 98.3% in inference time compared with the benchmark Integer Linear Programming (ILP) algorithm, and a mean reduction of 4.35% in power consumption compared with a Random Selection (RS) algorithm.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 111008"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129822","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":"Enhanced LR-FHSS receiver for headerless frame recovery in space–terrestrial integrated IoT networks","authors":"Diego Maldonado ,&nbsp;Leonardo S. Cardoso ,&nbsp;Juan A. Fraire ,&nbsp;Alexandre Guitton ,&nbsp;Oana Iova ,&nbsp;Megumi Kaneko ,&nbsp;Hervé Rivano","doi":"10.1016/j.comnet.2024.111018","DOIUrl":"10.1016/j.comnet.2024.111018","url":null,"abstract":"<div><div>Long-Range Frequency Hopping Spread Spectrum (LR-FHSS) is a recent IoT modulation technique designed for communication between low-power ground end-devices and Low-Earth Orbit (LEO) satellites. To successfully decode a frame, an LR-FHSS gateway must receive at least one header replica and a substantial portion of the payload fragments. However, the likelihood of LR-FHSS header loss increases with the number of concurrent transmissions. Moreover, Doppler effects (such as the Doppler shift and the Doppler rate) distort the signals the satellites receive. This paper investigates advanced receiver techniques for recovering LR-FHSS frames with lost headers characterized by significant Doppler effects. This paper’s main contribution is specifying and validating a novel LR-FHSS receiver model for space–terrestrial integrated IoT environments. Obtained simulation results prove that our enhanced LR-FHSS receiver can decode a significant portion of the missing frames, improving the overall throughput achievable by using the legacy LR-FHSS receiver.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 111018"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129826","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":"Two enhanced schemes for coordinated spatial reuse in IEEE 802.11be: Adaptive and distributed approaches","authors":"Deqing Zhu ,&nbsp;Lidong Wang ,&nbsp;Genmei Pan ,&nbsp;Shenji Luan","doi":"10.1016/j.comnet.2025.111060","DOIUrl":"10.1016/j.comnet.2025.111060","url":null,"abstract":"<div><div>Coordinated spatial reuse (CSR) is a novel mechanism that has attracted significant discussion in the upcoming Wi-Fi standard. Once a sharing access point (AP) acquires a transmission opportunity (TXOP), it informs a neighboring AP, designated as a shared AP, of the maximum tolerable interference level. The shared AP then calculates its maximum transmit power accordingly, thereby reducing interference and ensuring successful parallel transmissions. However, the CSR has three drawbacks. Firstly, it lacks explicit criteria for selecting multiple shared APs, disregarding the cumulative interference that arises from multiple shared APs. Secondly, excessive signaling occurs due to the periodic update and exchange of received signal strength indicator (RSSI) information among all the APs. Thirdly, the area throughput may suffer due to the low signal to interference plus noise ratio (SINR) experienced by shared APs, as only the shared AP constrains transmit power while the sharing AP transmits at its maximum.</div><div>To address these drawbacks, we propose two enhanced schemes for CSR. The first is adaptive CSR (ACSR), which can easily assess whether a neighboring AP should participate in CSR and adaptively determine the desired number of shared APs. The final transmit powers determined for shared APs in ACSR ensure that both the sharing AP and the shared APs meet the SINR requirements, thereby enhancing the performance of CSR. Furthermore, we propose a distributed CSR (DCSR) scheme, which formulates area throughput as a convex optimization problem. In DCSR, each AP independently and concurrently solves its own local optimization problems, drastically reducing the signaling overhead for RSSI update and exchange while obtaining optimal transmit powers for all involved APs. The DCSR scheme can adaptively determine the optimal number of shared APs. The proposed DCSR effectively overcomes all the drawbacks of the original CSR.</div><div>Analysis results show that the ACSR and DCSR outperform the CSR, achieving 1.45 and 2.57 times higher area throughput, respectively, and increasing the number of successful parallel transmissions (NSPT) by 1.45 and 2.8 times, respectively.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"258 ","pages":"Article 111060"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143176536","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":"ERASMIS: An ECC-based robust authentication protocol suitable for medical IoT systems","authors":"Mohammad Reza Servati ,&nbsp;Masoumeh Safkhani ,&nbsp;Amir Masoud Rahmani ,&nbsp;Mehdi Hosseinzadeh","doi":"10.1016/j.comnet.2024.110938","DOIUrl":"10.1016/j.comnet.2024.110938","url":null,"abstract":"<div><div>The “Internet of Things” (IoT) refers to the interconnection of physical devices that transmit and receive data over a network infrastructure. Wireless Sensor Networks (WSNs) are a key component of this infrastructure, facilitating data exchange through wireless channels. They are widely used in healthcare, transportation, smart home monitoring, and other applications. As IoT networks continue to evolve rapidly, security and privacy have become critical concerns. Security is essential within these systems, and privacy is especially important, as data transmitted over wireless channels can be intercepted, tracked, or tampered with.</div><div>In recent years, many authentication protocols have been proposed by researchers and experts. However, some of these protocols lack essential security features and fail to provide robust protection against various active and passive attacks. In this paper, we introduce ERASMIS, an authentication protocol based on elliptic curve cryptography (ECC) designed specifically for healthcare IoT systems. We explain how ERASMIS ensures security and present both informal and formal proofs of its security. Our formal security analyses, conducted with Real or Random (RoR) model and also tools such as Scyther and ProVerif demonstrate that the proposed protocol is resilient against numerous attacks while being more efficient than comparable schemes, with low computational and communication overhead. Furthermore, we have developed a Python implementation of the proposed protocol to evaluate its performance in real-world scenarios.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"258 ","pages":"Article 110938"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143177141","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":"Security applications in P4: Implementation and lessons learned","authors":"Ali Mazloum,&nbsp;Ali AlSabeh,&nbsp;Elie Kfoury,&nbsp;Jorge Crichigno","doi":"10.1016/j.comnet.2024.111011","DOIUrl":"10.1016/j.comnet.2024.111011","url":null,"abstract":"<div><div>The data plane, which used to provide a limited and fixed set of operations in legacy networking devices, is now programmable. The de-facto language to program the data plane is Programming Protocol-independent Packet Processors (P4). After compiling a P4 program, the resulting binary is loaded into the Application Specific Integrated Circuit (ASIC). The ASIC processes the packets based on the logic defined by the P4 program. The flexibility and granularity offered by programmable data plane devices allowed many security applications to be offloaded to the data plane. Thus, P4 and programmable devices allow the security applications to run on the hardware while sustaining the software’s flexibility, which enhances their performance. However, developing a P4 program is not straightforward.</div><div>The complexity associated with developing P4 applications has often been an obstacle for researchers. They mainly follow a trial-and-error approach to compile and fit their program into the ASIC. This paper tackles the issue by providing a comprehensive guide to the process of designing P4 security applications. It goes beyond theory and delves into practical implementation by showcasing the creation of several security applications on P4 programmable switches and sharing the P4 source code of these applications. In this paper, the authors will discuss the lessons they learned from implementing multiple security applications on programmable switches using P4, providing the reader with guidelines and insightful considerations.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 111011"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129200","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":"DeFlow: Differential flowlet switching for load balancing in datacenter networks","authors":"Ying Wan ,&nbsp;Haoyu Song ,&nbsp;Yu Jia ,&nbsp;Yi Wang ,&nbsp;Ling Qian ,&nbsp;Tian Pan","doi":"10.1016/j.comnet.2024.110980","DOIUrl":"10.1016/j.comnet.2024.110980","url":null,"abstract":"<div><div>Multipath enhances the reliability and bandwidth of datacenter networks, but it also necessitates effective load balancing. The dynamic nature of traffic and diverse flow characteristics present significant challenges in achieving optimal load distribution. Existing schemes either result in mediocre performance or rely on hard-acquired global information, leading to poor FCT or high implementation costs. This paper introduces DeFlow, a simple yet efficient flowlet-based load balancing scheme implementable on programmable switches with a low cost. DeFlow distinguishes flowlets of large and small flows based on packet size and interval. It employs distinct scheduling strategies for throughout-sensitive large flows and latency-sensitive small flows under congestion by prioritizing the performance of small flows. Extensive experiments on NS-3 demonstrate that DeFlow consistently outperforms competing schemes across various topologies and workloads, improving the FCT of small flows and throughput of large flows simultaneously.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110980"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129305","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":"Non-cooperative multi-agent deep reinforcement learning for channel resource allocation in vehicular networks","authors":"Fuxin Zhang,&nbsp;Sihan Yao,&nbsp;Wei Liu,&nbsp;Liang Qi","doi":"10.1016/j.comnet.2024.111006","DOIUrl":"10.1016/j.comnet.2024.111006","url":null,"abstract":"<div><div>Vehicle-to-vehicle (V2V) communication is a critical technology in supporting vehicle safety applications in vehicular networks. The high mobility in vehicular networks makes the channel state change rapidly, which poses significant challenges to reliable V2V communications. The traditional resource allocation methods neglect the fair requirement and cannot guarantee reliable transmission for each V2V link. In this paper, we first develop a network pay-off function to characterize the measure of satisfaction that a V2V link obtains from the network. Based on the pay-off function, the resource allocation problem among V2V links is formulated as a non-cooperation game problem. A non-cooperative multi-agent reinforcement learning method for resource sharing is then constructed. In this method, each V2V link is treated as an agent. Each agent interacts with unknown environments and neighboring agents to learn the best spectrum allocation and power control policy to reach a Nash equilibrium point for each V2V link, where they obtain fair transmissions and achieve reliable communications under different network scenarios. Experimental results indicate that our proposed method outperforms other benchmark schemes by more than 10% in packet delivery probability while achieving fair transmissions for V2V links.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 111006"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129379","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}