Computer Networks最新文献

英文中文

A hybrid multichannel MAC protocol with low local delay for vehicular ad hoc networks

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2025.111069

Nyi Nyi Linn , Yaodong Ma , Kai Liu , Xiangfen Wang

In vehicular ad hoc networks (VANETs), minimizing the local delay between vehicles and roadside units (RSUs) is crucial for achieving real-time safety communication. In this paper, we propose a hybrid multichannel medium access control (MAC) protocol with low local delay (LLD-HMMAC) that reduces both local delay and transmission overhead by integrating time-division multiple access (TDMA) and carrier-sense multiple access (CSMA) strategies. Firstly, a system model is proposed to estimate the signal strength of the corresponding RSU and neighboring vehicles by dividing vehicle communication range into three concentric circles, i.e. inner circle, outer circle and extending circle. Secondly, we propose a hybrid MAC structure to ensure the prioritized transmission of safety messages and optimize the negotiation processes of non-safety messages. In the CSMA period, we develop a channel dissemination method to mitigate the cumulative collisions caused by the frequent selection of numerous subcarriers and the same transmission batches. Furthermore, we propose a slot identification technique to reduce the probability of channel resource wastage in an RSU entanglement zone. Numerical and simulation results show that compared to existing protocols under different traffic densities, the proposed protocol can achieve substantially lower local delay in both uplink and downlink communications, improve throughput, and decrease the collision rate.

{"title":"A hybrid multichannel MAC protocol with low local delay for vehicular ad hoc networks","authors":"Nyi Nyi Linn , Yaodong Ma , Kai Liu , Xiangfen Wang","doi":"10.1016/j.comnet.2025.111069","DOIUrl":"10.1016/j.comnet.2025.111069","url":null,"abstract":"<div><div>In vehicular ad hoc networks (VANETs), minimizing the local delay between vehicles and roadside units (RSUs) is crucial for achieving real-time safety communication. In this paper, we propose a hybrid multichannel medium access control (MAC) protocol with low local delay (LLD-HMMAC) that reduces both local delay and transmission overhead by integrating time-division multiple access (TDMA) and carrier-sense multiple access (CSMA) strategies. Firstly, a system model is proposed to estimate the signal strength of the corresponding RSU and neighboring vehicles by dividing vehicle communication range into three concentric circles, i.e. inner circle, outer circle and extending circle. Secondly, we propose a hybrid MAC structure to ensure the prioritized transmission of safety messages and optimize the negotiation processes of non-safety messages. In the CSMA period, we develop a channel dissemination method to mitigate the cumulative collisions caused by the frequent selection of numerous subcarriers and the same transmission batches. Furthermore, we propose a slot identification technique to reduce the probability of channel resource wastage in an RSU entanglement zone. Numerical and simulation results show that compared to existing protocols under different traffic densities, the proposed protocol can achieve substantially lower local delay in both uplink and downlink communications, improve throughput, and decrease the collision rate.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"258 ","pages":"Article 111069"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143176533","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}

引用次数: 0

APQA: An anonymous post quantum access authentication scheme based on lattice for space ground integrated network

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2024.110979

Shanshan Wang , Chuan Xu , Guofeng Zhao , Zhenzhen Han , Rui Hu , Shui Yu

The rapidly developing Space Ground Integrated Network (SGIN) will provide communication services for massive nodes worldwide, and the authentication protocol is the key step in ensuring the security of SGIN. However, the current authentication schemes rely on security based on discrete logarithms and large integer decomposition problems, which are vulnerable to quantum computing attacks. Meanwhile, the energy and storage capacity of satellites are limited, making it impossible to deploy a highly complex authentication algorithm. Therefore, we propose an anonymous post quantum access authentication scheme based on lattice to meet the security requirements of the SGIN. During the registration phase, an online registration algorithm is developed using the Regev encryption mechanism to securely transmit the entity’s encrypted identity, thereby lowering the storage costs. In the authentication phase, an anonymous authentication algorithm based on the rejection sampling method is proposed to achieve the confidentiality of the private key and identity of the entity through zero-knowledge technology. This approach reduces the computational complexity of the authentication algorithm and decreases the computation time during the authentication phase. Theoretical proof and performance analysis demonstrate that the proposed scheme can resist quantum computation attacks and reduce the computation time by 36% compared to the existing authentication schemes.

{"title":"APQA: An anonymous post quantum access authentication scheme based on lattice for space ground integrated network","authors":"Shanshan Wang , Chuan Xu , Guofeng Zhao , Zhenzhen Han , Rui Hu , Shui Yu","doi":"10.1016/j.comnet.2024.110979","DOIUrl":"10.1016/j.comnet.2024.110979","url":null,"abstract":"<div><div>The rapidly developing Space Ground Integrated Network (SGIN) will provide communication services for massive nodes worldwide, and the authentication protocol is the key step in ensuring the security of SGIN. However, the current authentication schemes rely on security based on discrete logarithms and large integer decomposition problems, which are vulnerable to quantum computing attacks. Meanwhile, the energy and storage capacity of satellites are limited, making it impossible to deploy a highly complex authentication algorithm. Therefore, we propose an anonymous post quantum access authentication scheme based on lattice to meet the security requirements of the SGIN. During the registration phase, an online registration algorithm is developed using the Regev encryption mechanism to securely transmit the entity’s encrypted identity, thereby lowering the storage costs. In the authentication phase, an anonymous authentication algorithm based on the rejection sampling method is proposed to achieve the confidentiality of the private key and identity of the entity through zero-knowledge technology. This approach reduces the computational complexity of the authentication algorithm and decreases the computation time during the authentication phase. Theoretical proof and performance analysis demonstrate that the proposed scheme can resist quantum computation attacks and reduce the computation time by 36% compared to the existing authentication schemes.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110979"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129304","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}

引用次数: 0

Optimal obfuscation of awareness messages: Improving users’ unlinkability in Intelligent Transport Systems

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2024.110972

Yevhen Zolotavkin , Yurii Baryshev , Jannik Mähn , Vitalii Lukichov , Stefan Köpsell

This paper introduces a novel methodology to enhance privacy in Cooperative Intelligent Transport Systems (C-ITS) by improving unlinkability in vehicle-to-everything (V2X) communication. Focusing on the Cooperative Awareness Basic Service, we employ a Hidden Markov Model (HMM) to model the unlinkability of Cooperative Awareness Messages (CAMs) exchanged between vehicles and roadside units (RSUs) under the surveillance of a Global Passive Adversary (GPA). Implementing a joint obfuscation approach maximizes unlinkability by transforming the CAMs’ original data within a distortion threshold, preserving data utility while confounding the GPA’s ability to reliably link messages to specific vehicles. The experimental evaluation confirms the superiority of our method when compared with multivariate independent noise models, including Gaussian and Laplace. Our approach also incorporates an authentication protocol, ensuring the secure and collaborative execution of the obfuscation algorithm by the vehicles involved.

引用次数: 0

Service-aware Q-learning-based routing protocol in the underwater acoustic sensor network

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2024.110986

Shuyun Zhang , Huifang Chen , Lei Xie

Due to the high bit error ratio, long propagation delay, low transmission bandwidth and limited energy of sensor nodes, designing an appropriate routing protocol is an important issue in the underwater acoustic sensor network (UASN). In this paper, a service-aware Q-learning-based routing (SAQR) protocol is proposed in the UASN to support the diverse services, as well as achieving an efficient routing. The proposed protocol incorporates four factors in the reward function, and selects the neighboring node with the minimum Q value as the next hop. In addition, a set of candidate forwarding nodes is selected from the neighboring nodes, and a holding time mechanism is addressed to facilitate opportunistic transmission and improve the packet delivery ratio (PDR). Furthermore, a routing void handling mechanism is developed to enhance the reliability of data transmission in the UASN. Simulation results show that the proposed SAQR protocol performs well, in terms of the PDR, the end-to-end delay, the energy efficiency, in the dynamic underwater network environment.

引用次数: 0

The octagonal-cross-by-pass-mesh topology design for the on-chip-communication

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2024.110933

Usman Ali Gulzari , Waqar Farooq , Syed Nasir Mehmood Shah , Iftikhar Ahmed Khan , Sheraz Anjum , Zoran Salcic , Hessam Sarjoughian

This article presents the novel Octagonal-Cross-By-Pass-Mesh (Octa-CBP-Mesh) network topology design for on-chip communication. We have recently presented the cross-by-pass mesh (CBP-Mesh) topology, which outperformed its classed competitors like modified 2-Diamesional-meshes. The effectiveness of the Cross-by-pass links in the CBP-Mesh played a vital role in enhancing the capabilities of the network characteristics and the overall performance of the topology from its competitors. In this study, keeping in view the weaknesses of the CBP-Mesh network, we proposed the Octa-CBP-Mesh network topology, which further improved compared to state-of-the-art predecessors and competitors. The addition of intelligent CBP-Links in Octa-CBP-Mesh design reduces network diameter and improves other network parameters like increasing the bisection-width, path diversity, fault tolerance, and reduces the average number of hops. The synthetic and embedded application traffic traces were applied to the proposed Octa-CBP-Mesh, its predecessors, and its competitor topologies. The simulation results showed that the Octa-CBP-Mesh performed better in terms of network latency and throughput than state-of-the-art topologies with a negligible increase in network energy and power consumption than CBP-Mesh topology only.

{"title":"The octagonal-cross-by-pass-mesh topology design for the on-chip-communication","authors":"Usman Ali Gulzari , Waqar Farooq , Syed Nasir Mehmood Shah , Iftikhar Ahmed Khan , Sheraz Anjum , Zoran Salcic , Hessam Sarjoughian","doi":"10.1016/j.comnet.2024.110933","DOIUrl":"10.1016/j.comnet.2024.110933","url":null,"abstract":"<div><div>This article presents the novel Octagonal-Cross-By-Pass-Mesh (Octa-CBP-Mesh) network topology design for on-chip communication. We have recently presented the cross-by-pass mesh (CBP-Mesh) topology, which outperformed its classed competitors like modified 2-Diamesional-meshes. The effectiveness of the Cross-by-pass links in the CBP-Mesh played a vital role in enhancing the capabilities of the network characteristics and the overall performance of the topology from its competitors. In this study, keeping in view the weaknesses of the CBP-Mesh network, we proposed the Octa-CBP-Mesh network topology, which further improved compared to state-of-the-art predecessors and competitors. The addition of intelligent CBP-Links in Octa-CBP-Mesh design reduces network diameter and improves other network parameters like increasing the bisection-width, path diversity, fault tolerance, and reduces the average number of hops. The synthetic and embedded application traffic traces were applied to the proposed Octa-CBP-Mesh, its predecessors, and its competitor topologies. The simulation results showed that the Octa-CBP-Mesh performed better in terms of network latency and throughput than state-of-the-art topologies with a negligible increase in network energy and power consumption than CBP-Mesh topology only.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110933"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129439","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}

引用次数: 0

NeighborGeo: IP geolocation based on neighbors

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2024.110896

Xinye Wang , Dong Zhao , Xinran Liu , Zhaoxin Zhang , Tianzi Zhao

IP geolocation is crucial in fields such as cybersecurity, e-commerce, and social media. Current mainstream graph neural network methods have advanced localization accuracy by reframing the IP geolocation task as a node regression problem within an attribute graph, leveraging features to model the connectivity between nodes. However, in practical applications, landmarks are often scattered, irregular, and susceptible to outliers, which limits their accuracy due to the unreliability of landmark selection and relationship learning. To address these challenges, this paper introduces a novel IP geolocation model based on graph structure learning, termed NeighborGeo. This model employs reparameterization and supervised contrastive learning to precisely capture and selectively reinforce specific neighbor relationships between nodes in order to optimize structural representations. By accurately capturing and utilizing neighbors, this model achieves accurate predictions. Experimental results demonstrate that, on open-source datasets from New York, Los Angeles, and Shanghai, NeighborGeo achieves significantly higher localization accuracy compared to existing methods, particularly in scenarios with unevenly distributed landmarks.

{"title":"NeighborGeo: IP geolocation based on neighbors","authors":"Xinye Wang , Dong Zhao , Xinran Liu , Zhaoxin Zhang , Tianzi Zhao","doi":"10.1016/j.comnet.2024.110896","DOIUrl":"10.1016/j.comnet.2024.110896","url":null,"abstract":"<div><div>IP geolocation is crucial in fields such as cybersecurity, e-commerce, and social media. Current mainstream graph neural network methods have advanced localization accuracy by reframing the IP geolocation task as a node regression problem within an attribute graph, leveraging features to model the connectivity between nodes. However, in practical applications, landmarks are often scattered, irregular, and susceptible to outliers, which limits their accuracy due to the unreliability of landmark selection and relationship learning. To address these challenges, this paper introduces a novel IP geolocation model based on graph structure learning, termed NeighborGeo. This model employs reparameterization and supervised contrastive learning to precisely capture and selectively reinforce specific neighbor relationships between nodes in order to optimize structural representations. By accurately capturing and utilizing neighbors, this model achieves accurate predictions. Experimental results demonstrate that, on open-source datasets from New York, Los Angeles, and Shanghai, NeighborGeo achieves significantly higher localization accuracy compared to existing methods, particularly in scenarios with unevenly distributed landmarks.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110896"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129201","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}

引用次数: 0

AERO: An adaptive and efficient routing for off-chain payment channel networks

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2024.111009

Longxia Huang , Changzhi Huo , Chengzhi Ge , Mengmeng Yang

Blockchain technology faces significant scalability challenges, characterized by low throughput and high transaction fees. Off-chain payment channel networks offer a promising solution by enabling faster transaction processing by offloading transactions away from the main blockchain. While existing research has primarily focused on enhancing instantaneous throughput, it often overlooks the critical issue of fund distribution imbalance at either end of the channel following transactions. This imbalance can negatively impact subsequent transactions, leading to reduced long-term throughput. Furthermore, temporary insufficiencies in channel balances may cause transaction requests to fail, further hindering overall payment channel network (PCN) performance. To address these limitations, this paper introduces an adaptive and efficient routing scheme AERO that leverages a balance coefficient to assess fund availability within channels. AERO facilitates optimal transaction path selection while incorporating probabilistic measures to evaluate channel transaction capacity, ensuring adaptive routing with minimal transaction losses and enhancements. Additionally, the proposed transaction scheduling algorithm in AERO incorporates a waiting queue at the transaction node, executing transactions only when the channel’s capacity meets predefined requirements. Simulation results show that under the same network environment, AERO effectively maintains a throughput of approximately 70 even as transaction volumes rapidly increase. Moreover, AERO demonstrates notable cost efficiency, with transaction fees exceeding those of competing schemes by at least 5% in the Lightning topology and 25% in the Ripple topology.

{"title":"AERO: An adaptive and efficient routing for off-chain payment channel networks","authors":"Longxia Huang , Changzhi Huo , Chengzhi Ge , Mengmeng Yang","doi":"10.1016/j.comnet.2024.111009","DOIUrl":"10.1016/j.comnet.2024.111009","url":null,"abstract":"<div><div>Blockchain technology faces significant scalability challenges, characterized by low throughput and high transaction fees. Off-chain payment channel networks offer a promising solution by enabling faster transaction processing by offloading transactions away from the main blockchain. While existing research has primarily focused on enhancing instantaneous throughput, it often overlooks the critical issue of fund distribution imbalance at either end of the channel following transactions. This imbalance can negatively impact subsequent transactions, leading to reduced long-term throughput. Furthermore, temporary insufficiencies in channel balances may cause transaction requests to fail, further hindering overall payment channel network (PCN) performance. To address these limitations, this paper introduces an adaptive and efficient routing scheme AERO that leverages a balance coefficient to assess fund availability within channels. AERO facilitates optimal transaction path selection while incorporating probabilistic measures to evaluate channel transaction capacity, ensuring adaptive routing with minimal transaction losses and enhancements. Additionally, the proposed transaction scheduling algorithm in AERO incorporates a waiting queue at the transaction node, executing transactions only when the channel’s capacity meets predefined requirements. Simulation results show that under the same network environment, AERO effectively maintains a throughput of approximately 70 even as transaction volumes rapidly increase. Moreover, AERO demonstrates notable cost efficiency, with transaction fees exceeding those of competing schemes by at least 5% in the Lightning topology and 25% in the Ripple topology.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 111009"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129204","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}

引用次数: 0

A survey on encrypted network traffic: A comprehensive survey of identification/classification techniques, challenges, and future directions

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2024.110984

Adit Sharma, Arash Habibi Lashkari

Encrypted traffic detection and classification is a critical domain in network security, increasingly essential in an era of pervasive encryption. This survey paper delves into integrating advanced Machine Learning (ML) and Deep Learning (DL) techniques to address the challenges of robust encryption methods and dynamic network behaviors. Despite notable advancements, there remains a substantial gap in the operational application of these technologies, often constrained by scalability, efficiency, and adaptability to varied encryption standards. We critically review existing methodologies from 7 surveys and 82 related technical papers, highlight the shortcomings, and propose future research directions. Our analysis underscores the need to develop innovative, resource-efficient models that seamlessly adapt to new threats and encryption techniques without compromising performance. Additionally, we advocate for creating comprehensive datasets that merge encrypted and non-encrypted traffic to enhance model training and testing. This survey maps out the trajectory of recent developments and charts a course for future research that could significantly enhance encrypted traffic management and security capabilities.

{"title":"A survey on encrypted network traffic: A comprehensive survey of identification/classification techniques, challenges, and future directions","authors":"Adit Sharma, Arash Habibi Lashkari","doi":"10.1016/j.comnet.2024.110984","DOIUrl":"10.1016/j.comnet.2024.110984","url":null,"abstract":"<div><div>Encrypted traffic detection and classification is a critical domain in network security, increasingly essential in an era of pervasive encryption. This survey paper delves into integrating advanced Machine Learning (ML) and Deep Learning (DL) techniques to address the challenges of robust encryption methods and dynamic network behaviors. Despite notable advancements, there remains a substantial gap in the operational application of these technologies, often constrained by scalability, efficiency, and adaptability to varied encryption standards. We critically review existing methodologies from 7 surveys and 82 related technical papers, highlight the shortcomings, and propose future research directions. Our analysis underscores the need to develop innovative, resource-efficient models that seamlessly adapt to new threats and encryption techniques without compromising performance. Additionally, we advocate for creating comprehensive datasets that merge encrypted and non-encrypted traffic to enhance model training and testing. This survey maps out the trajectory of recent developments and charts a course for future research that could significantly enhance encrypted traffic management and security capabilities.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110984"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129212","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}

引用次数: 0

Probe-Optimizer: Discovering important nodes for proactive in-band network telemetry to achieve better probe orchestration

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2024.110935

Deyu Zhao , Guang Cheng , Xuan Chen , Yuyu Zhao , Wei Zhang , Lu Lu , Siyuan Zhou , Yuexia Fu

By embedding the state data maintained by the programmable data plane into additional customizable probes, proactive in-band network telemetry (INT) can easily achieve flexible, full-coverage and fine-grained network measurement. However, a significant portion of these probes are invalid, failing to capture meaningful network event information, and instead increasing bandwidth occupancy as well as communication overhead between the control plane and the data plane. Furthermore, these invalid probes exacerbate controller overhead, forcing resource-limited CPUs to perform a large amount of meaningless computation and analysis. In this paper, we propose Probe-Optimizer, a novel framework tailored for proactive INT, which can reduce the introduction of invalid probes to comprehensively lower the various telemetry overheads mentioned above. Technically, Probe-Optimizer assigns a unique importance to each node in the telemetry scenario. The importance is significantly related to the probability of network events occurring, which can be used to select important nodes worth monitoring in the topology over a period of time. Then, Probe-Optimizer generates a dedicated set of probe paths for important nodes and another set for the remaining nodes/links, customizing a more appropriate probe frequency for each probe path. Extensive evaluations on both random and FatTree topologies with different scales are conducted. The results show that Probe-Optimizer introduces significantly fewer invalid probes. Benefiting from this, for the topology with a size of more than 200 nodes, compared to the state-of-art proactive INT methods, Probe-Optimizer achieves a higher proportion of probes carrying network events and at least 13%, 42%, and 26% lower communication overhead, CPU usage, and average bandwidth occupancy, respectively.

{"title":"Probe-Optimizer: Discovering important nodes for proactive in-band network telemetry to achieve better probe orchestration","authors":"Deyu Zhao , Guang Cheng , Xuan Chen , Yuyu Zhao , Wei Zhang , Lu Lu , Siyuan Zhou , Yuexia Fu","doi":"10.1016/j.comnet.2024.110935","DOIUrl":"10.1016/j.comnet.2024.110935","url":null,"abstract":"<div><div>By embedding the state data maintained by the programmable data plane into additional customizable probes, proactive in-band network telemetry (INT) can easily achieve flexible, full-coverage and fine-grained network measurement. However, a significant portion of these probes are invalid, failing to capture meaningful network event information, and instead increasing bandwidth occupancy as well as communication overhead between the control plane and the data plane. Furthermore, these invalid probes exacerbate controller overhead, forcing resource-limited CPUs to perform a large amount of meaningless computation and analysis. In this paper, we propose Probe-Optimizer, a novel framework tailored for proactive INT, which can reduce the introduction of invalid probes to comprehensively lower the various telemetry overheads mentioned above. Technically, Probe-Optimizer assigns a unique importance to each node in the telemetry scenario. The importance is significantly related to the probability of network events occurring, which can be used to select important nodes worth monitoring in the topology over a period of time. Then, Probe-Optimizer generates a dedicated set of probe paths for important nodes and another set for the remaining nodes/links, customizing a more appropriate probe frequency for each probe path. Extensive evaluations on both random and FatTree topologies with different scales are conducted. The results show that Probe-Optimizer introduces significantly fewer invalid probes. Benefiting from this, for the topology with a size of more than 200 nodes, compared to the state-of-art proactive INT methods, Probe-Optimizer achieves a higher proportion of probes carrying network events and at least 13%, 42%, and 26% lower communication overhead, CPU usage, and average bandwidth occupancy, respectively.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110935"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129309","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}

引用次数: 0

Using spanners to improve network performance

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2024.110976

Guy Rozenberg, Michael Segal

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.

引用次数: 0

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Computer Networks

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀