Accurately estimating of Retransmission TimeOut (RTO) in Content-Centric Networking (CCN) is crucial for efficient rate control in end nodes and effective interface ranking in intermediate routers. Toward this end, th...Accurately estimating of Retransmission TimeOut (RTO) in Content-Centric Networking (CCN) is crucial for efficient rate control in end nodes and effective interface ranking in intermediate routers. Toward this end, the Jacobson algorithm, which is an Exponentially Weighted Moving Average (EWMA) on the Round Trip Time (RTT) of previous packets, is a promising scheme. Assigning the lower bound to RTO, determining how an EWMA rapidly adapts to changes, and setting the multiplier of variance RTT have the most impact on the accuracy of this estimator for which several evaluations have been performed to set them in Transmission Control Protocol/Internet Protocol (TCP/IP) networks. However, the performance of this estimator in CCN has not been explored yet, despite CCN having a significant architectural difference with TCP/IP networks. In this study, two new metrics for assessing the performance of RTO estimators in CCN are defined and the performance of the Jacobson algorithm in CCN is evaluated. This evaluation is performed by varying the minimum RTO, EWMA parameters, and multiplier of variance RTT against different content popularity distribution gains. The obtained results are used to reconsider the Jacobson algorithm for accurately estimating RTO in CCN. Comparing the performance of the reconsidered Jacobson estimator with the existing solutions shows that it can estimate RTO simply and more accurately without any additional information or computation overhead.展开更多
Content-Centric Networking is a novel future network architecture that attracts increasing research interests in recent years. In-network caching has been regarded as a prominent feature of Content-Centric Networking ...Content-Centric Networking is a novel future network architecture that attracts increasing research interests in recent years. In-network caching has been regarded as a prominent feature of Content-Centric Networking since it is able to reduce the network traffic, alleviate the server bottleneck and decrease the user access latency. However, the CCN default caching scheme results in a high caching redundancy, causing an urgent need for an efficient caching scheme. To address this issue, we propose a novel implicit cooperative caching scheme to efficiently reduce the caching redundancy and improve the cache resources utilization. The simulation results show that our design achieves a higher hit ratio and a shorter cache hit distance in comparison with the other typical caching schemes.展开更多
On-path caching is the prominent module in Content-Centric Networking(CCN),equipped with the capability to handle the demands of future networks such as the Internet of Things(IoT)and vehicular networks.The main focus...On-path caching is the prominent module in Content-Centric Networking(CCN),equipped with the capability to handle the demands of future networks such as the Internet of Things(IoT)and vehicular networks.The main focus of the CCN caching module is data dissemination within the network.Most of the existing strategies of in-network caching in CCN store the content at the maximumnumber of routers along the downloading path.Consequently,content redundancy in the network increases significantly,whereas the cache hit ratio and network performance decrease due to the unnecessary utilization of limited cache storage.Moreover,content redundancy adversely affects the cache resources,hit ratio,latency,bandwidth utilization,and server load.We proposed an in-network caching placement strategy named Coupling Parameters to Optimize Content Placement(COCP)to address the content redundancy and associated problems.The novelty of the technique lies in its capability tominimize content redundancy by creating a balanced cache space along the routing path by considering request rate,distance,and available cache space.The proposed approach minimizes the content redundancy and content dissemination within the network by using appropriate locations while increasing the cache hit ratio and network performance.The COCP is implemented in the simulator(Icarus)to evaluate its performance in terms of the cache hit ratio,path stretch,latency,and link load.Extensive experiments have been conducted to evaluate the proposed COCP strategy.The proposed COCP technique has been compared with the existing state-of-theart techniques,namely,Leave Copy Everywhere(LCE),Leave Copy Down(LCD),ProbCache,Cache Less forMore(CL4M),and opt-Cache.The results obtained with different cache sizes and popularities show that our proposed caching strategy can achieve up to 91.46%more cache hits,19.71%reduced latency,35.43%improved path stretch and 38.14%decreased link load.These results confirm that the proposed COCP strategy has the potential capability to handle the demands of future networks such as the Internet of Things(IoT)and vehicular networks.展开更多
As a named data-based clean-slate future Internet architecture,Content-Centric Networking(CCN)uses entirely different protocols and communication patterns from the host-to-host IP network.In CCN,communication is wholl...As a named data-based clean-slate future Internet architecture,Content-Centric Networking(CCN)uses entirely different protocols and communication patterns from the host-to-host IP network.In CCN,communication is wholly driven by the data consumer.Consumers must send Interest packets with the content name and not by the host’s network address.Its nature of in-network caching,Interest packets aggregation and hop-byhop communication poses unique challenges to provision of Internet applications,where traditional IP network no long works well.This paper presents a comprehensive survey of state-of-the-art application research activities related to CCN architecture.Our main aims in this survey are(a)to identify the advantages and drawbacks of CCN architectures for application provisioning;(b)to discuss the challenges and opportunities regarding service provisioning in CCN architectures;and(c)to further encourage deeper thinking about design principles for future Internet architectures from the perspective of upper-layer applications.展开更多
Content-centric Networking(CCN) is progressively flattering the substitutable approach to the Internet architecture through illuminating information(content) dissemination on the Internet with content forenames.The em...Content-centric Networking(CCN) is progressively flattering the substitutable approach to the Internet architecture through illuminating information(content) dissemination on the Internet with content forenames.The emergent proportion of Internet circulation has expectant adjusting Content-centric architecture to enhance serve the user prerequisites of accessing content.In recent years,one of the key aspects of CCN is ubiquitous in-network caching,which has been widely received great attention in research interest.One foremost shortcoming of in-network caching is that content producers have no awareness about where their content is put in storage.Because routers in CCN have caching capabilities,therefore,each and every content router can cache the content item in its storage capacity.This is problematic in the case in which a producer wishes to update or make the changes in its content item.In this paper,we present an approach regarding how to address this issue with a scheme called efficient content update(ECU).Our proposed ECU scheme achieves content update via trifling packets that resemble contemporary CCN communication messages with the use of additional table.We measure the performance of ECU scheme by means of simulations and make available a comprehensive exploration of its results.展开更多
There were two strategies for the data forwarding in the content-centric networking(CCN): forwarding strategy and routing strategy. Forwarding strategy only considered a separated node rather than the whole network pe...There were two strategies for the data forwarding in the content-centric networking(CCN): forwarding strategy and routing strategy. Forwarding strategy only considered a separated node rather than the whole network performance, and Interest flooding led to the network overhead and redundancy as well. As for routing strategy in CCN, each node was required to run the protocol. It was a waste of routing cost and unfit for large-scale deployment.This paper presents the super node routing strategy in CCN. Some super nodes selected from the peer nodes in CCN were used to receive the routing information from their slave nodes and compute the face-to-path to establish forwarding information base(FIB). Then FIB was sent to slave nodes to control and manage the slave nodes. The theoretical analysis showed that the super node routing strategy possessed robustness and scalability, achieved load balancing,reduced the redundancy and improved the network performance. In three topologies, three experiments were carried out to test the super node routing strategy. Network performance results showed that the proposed strategy had a shorter delay, lower CPU utilization and less redundancy compared with CCN.展开更多
Recently, content-centric networking （CCN） has become a hot research topic for the diffusion of contents over the Internet. Most existing works on CCN focus on the improvement of network resource utilization. Conseq...Recently, content-centric networking （CCN） has become a hot research topic for the diffusion of contents over the Internet. Most existing works on CCN focus on the improvement of network resource utilization. Consequently, the energy consumption aspect of CCN is largely ignored. In this paper, we propose a distributed energyefficient in-network caching scheme for CCN, where each content router only needs locally available information to make caching decisions considering both caching energy consumption and transport energy consumption. We formulate the in-network caching problem as a non-cooperative game. Through rigorous mathematical analysis, we prove that pure strategy Nash equilibria exist in the proposed scheme, and it always has a strategy profile that implements the socially optimal configuration, even if the touters are self-interested in nature. Simulation results are presented to show that the distributed solution is competitive to the centralized scheme, and has superior performance compared to other popular caching schemes in CCN. Besides, it exhibits a fast convergence speed when the capacity of content routers varies.展开更多
In-network caching and Interest packets aggregation are two important features of Content-Centric Networking(CCN).CCN routers can directly respond to the Interest request by Content Store(CS)and aggregate the same Int...In-network caching and Interest packets aggregation are two important features of Content-Centric Networking(CCN).CCN routers can directly respond to the Interest request by Content Store(CS)and aggregate the same Interest packets by Pending Interest Table(PIT).In this way,most popular content requests will not reach the origin content server.Thus,content providers will be unaware of the actual usages of their contents in network.This new network paradigm presents content providers with unprecedented challenge.It will bring a great impact on existing mature business model of content providers,such as advertising revenue model based on hits amount.To leverage the advantages of CCN and the realistic business needs of content providers,we explore the hits-based content provisioning mechanism in CCN.The proposed approaches can avoid the unprecedented impact on content providers' existing business model and promote content providers to embrace the real deployment of CCN network.展开更多
Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combinin...Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combining double deep Q-networks(DDQNs)and graph neural networks(GNNs)for joint routing and resource allocation.The framework uses GNNs to model the network topology and DDQNs to adaptively control routing and resource allocation,addressing interference and improving network performance.Simulation results show that the proposed approach outperforms traditional methods such as Closest-to-Destination(c2Dst),Max-SINR(mSINR),and Multi-Layer Perceptron(MLP)-based models,achieving approximately 23.5% improvement in throughput,50% increase in connection probability,and 17.6% reduction in number of hops,demonstrating its effectiveness in dynamic UAV networks.展开更多
To explore the material basis and mechanisms of the anti-inflammatory effects of Hibiscus mutabilis L..The active ingredients and potential targets of Hibiscus mutabilis L.were obtained through the literature review a...To explore the material basis and mechanisms of the anti-inflammatory effects of Hibiscus mutabilis L..The active ingredients and potential targets of Hibiscus mutabilis L.were obtained through the literature review and SwissADME platform.Genes related to the inflammation were collected using Genecards and OMIM databases,and the intersection genes were submitted on STRING and DAVID websites.Then,the protein interaction network(PPI),gene ontology(GO)and pathway(KEGG)were analyzed.Cytoscape 3.7.2 software was used to construct the“Hibiscus mutabilis L.-active ingredient-target-inflammation”network diagram,and AutoDockTools-1.5.6 software was used for the molecular docking verification.The antiinflammatory effect of Hibiscus mutabilis L.active ingredient was verified by the RAW264.7 inflammatory cell model.The results showed that 11 active components and 94 potential targets,1029 inflammatory targets and 24 intersection targets were obtained from Hibiscus mutabilis L..The key anti-inflammatory active ingredients of Hibiscus mutabilis L.are quercetin,apigenin and luteolin.Its action pathway is mainly related to NF-κB,cancer pathway and TNF signaling pathway.Cell experiments showed that total flavonoids of Hibiscus mutabilis L.could effectively inhibit the expression of tumor necrosis factor(TNF-α),interleukin 8(IL-8)and epidermal growth factor receptor(EGFR)in LPS-induced RAW 264.7 inflammatory cells.It also downregulates the phosphorylation of human nuclear factor ĸB inhibitory protein α(IĸBα)and NF-κB p65 subunit protein(p65).Overall,the anti-inflammatory effect of Hibiscus mutabilis L.is related to many active components,many signal pathways and targets,which provides a theoretical basis for its further development and application.展开更多
The existence of absorption and reflection of light underwater leads to problems such as color distortion and blue-green bias in underwater images.In this study,a depthwise separable convolution-based generative adver...The existence of absorption and reflection of light underwater leads to problems such as color distortion and blue-green bias in underwater images.In this study,a depthwise separable convolution-based generative adversarial network(GAN)algorithm was proposed.Taking GAN as the basic framework,it combined a depthwise separable convolution module,attention mechanism,and reconstructed convolution module to realize the enhancement of underwater degraded images.Multi-scale features were captured by the depthwise separable convolution module,and the attention mechanism was utilized to enhance attention to important features.The reconstructed convolution module further extracts and fuses local and global features.Experimental results showed that the algorithm performs well in improving the color bias and blurring of underwater images,with PSNR reaching 27.835,SSIM reaching 0.883,UIQM reaching 3.205,and UCIQE reaching 0.713.The enhanced image outperforms the comparison algorithm in both subjective and objective metrics.展开更多
Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)t...Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)techniques for DDoS attack diagnosis normally apply network traffic statistical features such as packet sizes and inter-arrival times.However,such techniques sometimes fail to capture complicated relations among various traffic flows.In this paper,we present a new multi-scale ensemble strategy given the Graph Neural Networks(GNNs)for improving DDoS detection.Our technique divides traffic into macro-and micro-level elements,letting various GNN models to get the two corase-scale anomalies and subtle,stealthy attack models.Through modeling network traffic as graph-structured data,GNNs efficiently learn intricate relations among network entities.The proposed ensemble learning algorithm combines the results of several GNNs to improve generalization,robustness,and scalability.Extensive experiments on three benchmark datasets—UNSW-NB15,CICIDS2017,and CICDDoS2019—show that our approach outperforms traditional machine learning and deep learning models in detecting both high-rate and low-rate(stealthy)DDoS attacks,with significant improvements in accuracy and recall.These findings demonstrate the suggested method’s applicability and robustness for real-world implementation in contexts where several DDoS patterns coexist.展开更多
Networked predictive control(NPC) has gained significant attention in recent years for its ability to effectively and actively address communication constraints in networked control systems(NCSs),such as network-induc...Networked predictive control(NPC) has gained significant attention in recent years for its ability to effectively and actively address communication constraints in networked control systems(NCSs),such as network-induced delays,packet dropouts,and packet disorders.Despite significant advancements,the increasing complexity and dynamism of network environments,along with the growing complexity of systems,pose new challenges for NPC.These challenges include difficulties in system modeling,cyber attacks,component faults,limited network bandwidth,and the necessity for distributed collaboration.This survey aims to provide a comprehensive review of NPC strategies.It begins with a summary of the primary challenges faced by NCSs,followed by an introduction to the control structure and core concepts of NPC.The survey then discusses several typical NPC schemes and examines their extensions in the areas of secure control,fault-tolerant control,distributed coordinated control,and event-triggered control.Moreover,it reviews notable works that have implemented these schemes.Finally,the survey concludes by exploring typical applications of NPC schemes and highlighting several challenging issues that could guide future research efforts.展开更多
A multi-stimuli-responsive hydrogel,P(VI-co-MAAC-NE),was successfully constructed by covalently integrating the aggregation-induced emission(AIE)moiety(Z)-N-(4-(1-cyano-2-(4-(diethylamino)phenyl)vinyl)-phenyl)methacry...A multi-stimuli-responsive hydrogel,P(VI-co-MAAC-NE),was successfully constructed by covalently integrating the aggregation-induced emission(AIE)moiety(Z)-N-(4-(1-cyano-2-(4-(diethylamino)phenyl)vinyl)-phenyl)methacrylamide(NE)into a dynamic hydrogen-bonding network composed of 1-vinylimidazole(VI)and methacrylic acid(MAAC)groups.The dense hydrogen-bonding network not only provides enhanced mechanical robustness,but also significantly enhances the AIE effect of NE by restricting its molecular motion.Under various external stimuli,the hydrogen bonds within the hydrogel network undergo reversible dissociation and reformation,thus enabling synergistic modulation of the hydrogel’s mechanical properties and luminescence behavior.Specifically,organic solvents disrupt the hydrogen-bonding network and the aggregation of the AIE moiety NE,resulting in macroscopic swelling and fluorescence quenching of the hydrogel.In strongly acidic conditions,protonation of NE molecules suppresses the intramolecular charge transfer(ICT)process,yielding a blue-shifted emission band accompanied by intense blue fluorescence;in highly alkaline environments,deprotonation of carboxyl groups induces hydrogel swelling and disperses NE aggregates,leading to pronounced fluorescence quenching.Moreover,the system exhibits thermally activated shape-memory behavior:heating above the glass transition temperature(T_(g):ca.62℃)softens the hydrogel to allow programmable reshaping,and subsequent hydrogen bond reformation at ambient conditions locks in the resultant geometries without sacrificing the hydrogel’s fluorescence performance.By capitalizing on these multi-stimuli-responsive characteristics and shape-memory behavior,the potential of hydrogel P(VI-co-MAAC-NE)for advanced information encryption and anti-counterfeiting applications is demonstrated.This work not only provides a versatile material platform for sensing and information storage,but also offers new insights into the design of intelligent soft materials integrating AIE features with dynamically regulated supramolecular network structures.展开更多
Urbanization is a significant driver of the loss of biodiversity and the disruption of ecosystems.Amphibians are especially vulnerable to the negative impact of urbanization as their life cycles and habitat requiremen...Urbanization is a significant driver of the loss of biodiversity and the disruption of ecosystems.Amphibians are especially vulnerable to the negative impact of urbanization as their life cycles and habitat requirements are complex.The present study investigated the effects of urbanization on amphibian predation networks in suburban Kunming in Yunnan,China and aimed to understand how predation network structure and stability vary with urbanization level.We constructed predation networks by analyzing the stomach contents of amphibians from 12d istinct urbanization gradients.We used the bipartite package in R to evaluate network robustness metrics such as modularity,nestedness,connectivity,and average shortest path length(ASPL).We found that urbanization level is negatively correlated with predation network connectivity(R=−0.67,Ρ=0.02),but there were no significant correlations between urbanization level and nestedness,modularity,or ASPL.Removal of the keystone species destabilized the predation networks at certain locations.The present work highlighted that maintaining prey quantity and diversity preserves predation network connectivity and stabilizes the overall network in urbanizing landscapes.It also underscored the critical role that keystone species play in sustaining network robustness.The results of this research provided insights into the ecological consequences of urbanization.They also suggested that conservation measures should protect the key species and habitats of amphibian predation networks and mitigate the negative impact of urban development on them.展开更多
In the process of programmable networks simplifying network management and increasing network flexibility through custom packet behavior,security incidents caused by human logic errors are seriously threatening their ...In the process of programmable networks simplifying network management and increasing network flexibility through custom packet behavior,security incidents caused by human logic errors are seriously threatening their safe operation,robust verificationmethods are required to ensure their correctness.As one of the formalmethods,symbolic execution offers a viable approach for verifying programmable networks by systematically exploring all possible paths within a program.However,its application in this field encounters scalability issues due to path explosion and complex constraint-solving.Therefore,in this paper,we propose NetVerifier,a scalable verification system for programmable networks.Tomitigate the path explosion issue,we developmultiple pruning strategies that strategically eliminate irrelevant execution paths while preserving verification integrity by precisely identifying the execution paths related to the verification purpose.To address the complex constraint-solving problem,we introduce an execution results reuse solution to avoid redundant computation of the same constraints.To apply these solutions intelligently,a matching algorithm is implemented to automatically select appropriate solutions based on the characteristics of the verification requirement.Moreover,Language Aided Verification(LAV),an assertion language,is designed to express verification intentions in a concise form.Experimental results on diverse open-source programs of varying scales demonstrate NetVerifier’s improvement in scalability and effectiveness in identifying potential network errors.In the best scenario,compared with ASSERT-P4,NetVerifier reduced the execution path,verification time,and memory occupation of the verification process by 99.92%,94.76%,and 65.19%,respectively.展开更多
Near-infrared image sensors are widely used in fields such as material identification,machine vision,and autonomous driving.Lead sulfide colloidal quantum dot-based infrared photodiodes can be integrated with sil⁃icon...Near-infrared image sensors are widely used in fields such as material identification,machine vision,and autonomous driving.Lead sulfide colloidal quantum dot-based infrared photodiodes can be integrated with sil⁃icon-based readout circuits in a single step.Based on this,we propose a photodiode based on an n-i-p structure,which removes the buffer layer and further simplifies the manufacturing process of quantum dot image sensors,thus reducing manufacturing costs.Additionally,for the noise complexity in quantum dot image sensors when capturing images,traditional denoising and non-uniformity methods often do not achieve optimal denoising re⁃sults.For the noise and stripe-type non-uniformity commonly encountered in infrared quantum dot detector imag⁃es,a network architecture has been developed that incorporates multiple key modules.This network combines channel attention and spatial attention mechanisms,dynamically adjusting the importance of feature maps to en⁃hance the ability to distinguish between noise and details.Meanwhile,the residual dense feature fusion module further improves the network's ability to process complex image structures through hierarchical feature extraction and fusion.Furthermore,the pyramid pooling module effectively captures information at different scales,improv⁃ing the network's multi-scale feature representation ability.Through the collaborative effect of these modules,the network can better handle various mixed noise and image non-uniformity issues.Experimental results show that it outperforms the traditional U-Net network in denoising and image correction tasks.展开更多
Identifying the community structure of complex networks is crucial to extracting insights and understanding network properties.Although several community detection methods have been proposed,many are unsuitable for so...Identifying the community structure of complex networks is crucial to extracting insights and understanding network properties.Although several community detection methods have been proposed,many are unsuitable for social networks due to significant limitations.Specifically,most approaches depend mainly on user-user structural links while overlooking service-centric,semantic,and multi-attribute drivers of community formation,and they also lack flexible filtering mechanisms for large-scale,service-oriented settings.Our proposed approach,called community discovery-based service(CDBS),leverages user profiles and their interactions with consulted web services.The method introduces a novel similarity measure,global similarity interaction profile(GSIP),which goes beyond typical similarity measures by unifying user and service profiles for all attributes types into a coherent representation,thereby clarifying its novelty and contribution.It applies multiple filtering criteria related to user attributes,accessed services,and interaction patterns.Experimental comparisons against Louvain,Hierarchical Agglomerative Clustering,Label Propagation and Infomap show that CDBS reveals the higher performance as it achieves 0.74 modularity,0.13 conductance,0.77 coverage,and significantly fast response time of 9.8 s,even with 10,000 users and 400 services.Moreover,community discoverybased service consistently detects a larger number of communities with distinct topics of interest,underscoring its capacity to generate detailed and efficient structures in complex networks.These results confirm both the efficiency and effectiveness of the proposed method.Beyond controlled evaluation,communities discovery based service is applicable to targeted recommendations,group-oriented marketing,access control,and service personalization,where communities are shaped not only by user links but also by service engagement.展开更多
With the growing complexity and decentralization of network systems,the attack surface has expanded,which has led to greater concerns over network threats.In this context,artificial intelligence(AI)-based network intr...With the growing complexity and decentralization of network systems,the attack surface has expanded,which has led to greater concerns over network threats.In this context,artificial intelligence(AI)-based network intrusion detection systems(NIDS)have been extensively studied,and recent efforts have shifted toward integrating distributed learning to enable intelligent and scalable detection mechanisms.However,most existing works focus on individual distributed learning frameworks,and there is a lack of systematic evaluations that compare different algorithms under consistent conditions.In this paper,we present a comprehensive evaluation of representative distributed learning frameworks—Federated Learning(FL),Split Learning(SL),hybrid collaborative learning(SFL),and fully distributed learning—in the context of AI-driven NIDS.Using recent benchmark intrusion detection datasets,a unified model backbone,and controlled distributed scenarios,we assess these frameworks across multiple criteria,including detection performance,communication cost,computational efficiency,and convergence behavior.Our findings highlight distinct trade-offs among the distributed learning frameworks,demonstrating that the optimal choice depends strongly on systemconstraints such as bandwidth availability,node resources,and data distribution.This work provides the first holistic analysis of distributed learning approaches for AI-driven NIDS and offers practical guidelines for designing secure and efficient intrusion detection systems in decentralized environments.展开更多
With network attack technology continuing to develop,traditional anomaly traffic detection methods that rely on feature engineering are increasingly insufficient in efficiency and accuracy.Graph Neural Network(GNN),a ...With network attack technology continuing to develop,traditional anomaly traffic detection methods that rely on feature engineering are increasingly insufficient in efficiency and accuracy.Graph Neural Network(GNN),a promising Deep Learning(DL)approach,has proven to be highly effective in identifying intricate patterns in graph⁃structured data and has already found wide applications in the field of network security.In this paper,we propose a hybrid Graph Convolutional Network(GCN)⁃GraphSAGE model for Anomaly Traffic Detection,namely HGS⁃ATD,which aims to improve the accuracy of anomaly traffic detection by leveraging edge feature learning to better capture the relationships between network entities.We validate the HGS⁃ATD model on four publicly available datasets,including NF⁃UNSW⁃NB15⁃v2.The experimental results show that the enhanced hybrid model is 5.71%to 10.25%higher than the baseline model in terms of accuracy,and the F1⁃score is 5.53%to 11.63%higher than the baseline model,proving that the model can effectively distinguish normal traffic from attack traffic and accurately classify various types of attacks.展开更多
文摘Accurately estimating of Retransmission TimeOut (RTO) in Content-Centric Networking (CCN) is crucial for efficient rate control in end nodes and effective interface ranking in intermediate routers. Toward this end, the Jacobson algorithm, which is an Exponentially Weighted Moving Average (EWMA) on the Round Trip Time (RTT) of previous packets, is a promising scheme. Assigning the lower bound to RTO, determining how an EWMA rapidly adapts to changes, and setting the multiplier of variance RTT have the most impact on the accuracy of this estimator for which several evaluations have been performed to set them in Transmission Control Protocol/Internet Protocol (TCP/IP) networks. However, the performance of this estimator in CCN has not been explored yet, despite CCN having a significant architectural difference with TCP/IP networks. In this study, two new metrics for assessing the performance of RTO estimators in CCN are defined and the performance of the Jacobson algorithm in CCN is evaluated. This evaluation is performed by varying the minimum RTO, EWMA parameters, and multiplier of variance RTT against different content popularity distribution gains. The obtained results are used to reconsider the Jacobson algorithm for accurately estimating RTO in CCN. Comparing the performance of the reconsidered Jacobson estimator with the existing solutions shows that it can estimate RTO simply and more accurately without any additional information or computation overhead.
基金supported in part by the 973 Program under Grant No.2013CB329100in part by NSFC under Grant No.61422101,62171200,and 62132017+1 种基金in part by the Ph.D. Programs Foundation of MOE of China under Grant No.20130009110014in part by the Fundamental Research Funds for the Central Universities under Grant No.2016JBZ002
文摘Content-Centric Networking is a novel future network architecture that attracts increasing research interests in recent years. In-network caching has been regarded as a prominent feature of Content-Centric Networking since it is able to reduce the network traffic, alleviate the server bottleneck and decrease the user access latency. However, the CCN default caching scheme results in a high caching redundancy, causing an urgent need for an efficient caching scheme. To address this issue, we propose a novel implicit cooperative caching scheme to efficiently reduce the caching redundancy and improve the cache resources utilization. The simulation results show that our design achieves a higher hit ratio and a shorter cache hit distance in comparison with the other typical caching schemes.
基金This work was supported by Taif University Researchers Supporting Project Number(TURSP-2020/292),Taif University,Taif,Saudi Arabia。
文摘On-path caching is the prominent module in Content-Centric Networking(CCN),equipped with the capability to handle the demands of future networks such as the Internet of Things(IoT)and vehicular networks.The main focus of the CCN caching module is data dissemination within the network.Most of the existing strategies of in-network caching in CCN store the content at the maximumnumber of routers along the downloading path.Consequently,content redundancy in the network increases significantly,whereas the cache hit ratio and network performance decrease due to the unnecessary utilization of limited cache storage.Moreover,content redundancy adversely affects the cache resources,hit ratio,latency,bandwidth utilization,and server load.We proposed an in-network caching placement strategy named Coupling Parameters to Optimize Content Placement(COCP)to address the content redundancy and associated problems.The novelty of the technique lies in its capability tominimize content redundancy by creating a balanced cache space along the routing path by considering request rate,distance,and available cache space.The proposed approach minimizes the content redundancy and content dissemination within the network by using appropriate locations while increasing the cache hit ratio and network performance.The COCP is implemented in the simulator(Icarus)to evaluate its performance in terms of the cache hit ratio,path stretch,latency,and link load.Extensive experiments have been conducted to evaluate the proposed COCP strategy.The proposed COCP technique has been compared with the existing state-of-theart techniques,namely,Leave Copy Everywhere(LCE),Leave Copy Down(LCD),ProbCache,Cache Less forMore(CL4M),and opt-Cache.The results obtained with different cache sizes and popularities show that our proposed caching strategy can achieve up to 91.46%more cache hits,19.71%reduced latency,35.43%improved path stretch and 38.14%decreased link load.These results confirm that the proposed COCP strategy has the potential capability to handle the demands of future networks such as the Internet of Things(IoT)and vehicular networks.
基金supported in part by the National Natural Science Foundation of China (NSFC) under Grant 61671081in part by the Funds for International Cooperation and Exchange of NSFC under Grant 61720106007+2 种基金in part by the 111 Project under Grant B18008in part by the Beijing Natural Science Foundation under Grant 4172042in part by the Fundamental Research Funds for the Central Universities under Grant 2018XKJC01
文摘As a named data-based clean-slate future Internet architecture,Content-Centric Networking(CCN)uses entirely different protocols and communication patterns from the host-to-host IP network.In CCN,communication is wholly driven by the data consumer.Consumers must send Interest packets with the content name and not by the host’s network address.Its nature of in-network caching,Interest packets aggregation and hop-byhop communication poses unique challenges to provision of Internet applications,where traditional IP network no long works well.This paper presents a comprehensive survey of state-of-the-art application research activities related to CCN architecture.Our main aims in this survey are(a)to identify the advantages and drawbacks of CCN architectures for application provisioning;(b)to discuss the challenges and opportunities regarding service provisioning in CCN architectures;and(c)to further encourage deeper thinking about design principles for future Internet architectures from the perspective of upper-layer applications.
文摘Content-centric Networking(CCN) is progressively flattering the substitutable approach to the Internet architecture through illuminating information(content) dissemination on the Internet with content forenames.The emergent proportion of Internet circulation has expectant adjusting Content-centric architecture to enhance serve the user prerequisites of accessing content.In recent years,one of the key aspects of CCN is ubiquitous in-network caching,which has been widely received great attention in research interest.One foremost shortcoming of in-network caching is that content producers have no awareness about where their content is put in storage.Because routers in CCN have caching capabilities,therefore,each and every content router can cache the content item in its storage capacity.This is problematic in the case in which a producer wishes to update or make the changes in its content item.In this paper,we present an approach regarding how to address this issue with a scheme called efficient content update(ECU).Our proposed ECU scheme achieves content update via trifling packets that resemble contemporary CCN communication messages with the use of additional table.We measure the performance of ECU scheme by means of simulations and make available a comprehensive exploration of its results.
基金Supported by the National Basic Research Program of China("973"Program,No.2013CB329100)Beijing Higher Education Young Elite Teacher Project(No.YETP0534)
文摘There were two strategies for the data forwarding in the content-centric networking(CCN): forwarding strategy and routing strategy. Forwarding strategy only considered a separated node rather than the whole network performance, and Interest flooding led to the network overhead and redundancy as well. As for routing strategy in CCN, each node was required to run the protocol. It was a waste of routing cost and unfit for large-scale deployment.This paper presents the super node routing strategy in CCN. Some super nodes selected from the peer nodes in CCN were used to receive the routing information from their slave nodes and compute the face-to-path to establish forwarding information base(FIB). Then FIB was sent to slave nodes to control and manage the slave nodes. The theoretical analysis showed that the super node routing strategy possessed robustness and scalability, achieved load balancing,reduced the redundancy and improved the network performance. In three topologies, three experiments were carried out to test the super node routing strategy. Network performance results showed that the proposed strategy had a shorter delay, lower CPU utilization and less redundancy compared with CCN.
基金supported under the National Basic Research Program(973) of China(Project Number: 2012CB315801)the National Natural Science Fund(Project Number:61300184)the fundamental research funds for the Central Universities(Project Number:2013RC0113)
文摘Recently, content-centric networking （CCN） has become a hot research topic for the diffusion of contents over the Internet. Most existing works on CCN focus on the improvement of network resource utilization. Consequently, the energy consumption aspect of CCN is largely ignored. In this paper, we propose a distributed energyefficient in-network caching scheme for CCN, where each content router only needs locally available information to make caching decisions considering both caching energy consumption and transport energy consumption. We formulate the in-network caching problem as a non-cooperative game. Through rigorous mathematical analysis, we prove that pure strategy Nash equilibria exist in the proposed scheme, and it always has a strategy profile that implements the socially optimal configuration, even if the touters are self-interested in nature. Simulation results are presented to show that the distributed solution is competitive to the centralized scheme, and has superior performance compared to other popular caching schemes in CCN. Besides, it exhibits a fast convergence speed when the capacity of content routers varies.
基金This work was supported by National Key Basic Research Program of China （973 Program） under Grant No. 2012CB315802 National Natural Science Foundation of China under Grant No. 61171102 and No. 61132001 Prospective Research on Future Networks of Jiangsu Future Networks Innovation institute under Grant No. BY2013095-4-01. Beijing Nova Program under Grant No.2008B50 and Beijing Higher Education Young Elite Teacher Project under Grant No.YETP0478.
文摘In-network caching and Interest packets aggregation are two important features of Content-Centric Networking(CCN).CCN routers can directly respond to the Interest request by Content Store(CS)and aggregate the same Interest packets by Pending Interest Table(PIT).In this way,most popular content requests will not reach the origin content server.Thus,content providers will be unaware of the actual usages of their contents in network.This new network paradigm presents content providers with unprecedented challenge.It will bring a great impact on existing mature business model of content providers,such as advertising revenue model based on hits amount.To leverage the advantages of CCN and the realistic business needs of content providers,we explore the hits-based content provisioning mechanism in CCN.The proposed approaches can avoid the unprecedented impact on content providers' existing business model and promote content providers to embrace the real deployment of CCN network.
文摘Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combining double deep Q-networks(DDQNs)and graph neural networks(GNNs)for joint routing and resource allocation.The framework uses GNNs to model the network topology and DDQNs to adaptively control routing and resource allocation,addressing interference and improving network performance.Simulation results show that the proposed approach outperforms traditional methods such as Closest-to-Destination(c2Dst),Max-SINR(mSINR),and Multi-Layer Perceptron(MLP)-based models,achieving approximately 23.5% improvement in throughput,50% increase in connection probability,and 17.6% reduction in number of hops,demonstrating its effectiveness in dynamic UAV networks.
文摘To explore the material basis and mechanisms of the anti-inflammatory effects of Hibiscus mutabilis L..The active ingredients and potential targets of Hibiscus mutabilis L.were obtained through the literature review and SwissADME platform.Genes related to the inflammation were collected using Genecards and OMIM databases,and the intersection genes were submitted on STRING and DAVID websites.Then,the protein interaction network(PPI),gene ontology(GO)and pathway(KEGG)were analyzed.Cytoscape 3.7.2 software was used to construct the“Hibiscus mutabilis L.-active ingredient-target-inflammation”network diagram,and AutoDockTools-1.5.6 software was used for the molecular docking verification.The antiinflammatory effect of Hibiscus mutabilis L.active ingredient was verified by the RAW264.7 inflammatory cell model.The results showed that 11 active components and 94 potential targets,1029 inflammatory targets and 24 intersection targets were obtained from Hibiscus mutabilis L..The key anti-inflammatory active ingredients of Hibiscus mutabilis L.are quercetin,apigenin and luteolin.Its action pathway is mainly related to NF-κB,cancer pathway and TNF signaling pathway.Cell experiments showed that total flavonoids of Hibiscus mutabilis L.could effectively inhibit the expression of tumor necrosis factor(TNF-α),interleukin 8(IL-8)and epidermal growth factor receptor(EGFR)in LPS-induced RAW 264.7 inflammatory cells.It also downregulates the phosphorylation of human nuclear factor ĸB inhibitory protein α(IĸBα)and NF-κB p65 subunit protein(p65).Overall,the anti-inflammatory effect of Hibiscus mutabilis L.is related to many active components,many signal pathways and targets,which provides a theoretical basis for its further development and application.
文摘The existence of absorption and reflection of light underwater leads to problems such as color distortion and blue-green bias in underwater images.In this study,a depthwise separable convolution-based generative adversarial network(GAN)algorithm was proposed.Taking GAN as the basic framework,it combined a depthwise separable convolution module,attention mechanism,and reconstructed convolution module to realize the enhancement of underwater degraded images.Multi-scale features were captured by the depthwise separable convolution module,and the attention mechanism was utilized to enhance attention to important features.The reconstructed convolution module further extracts and fuses local and global features.Experimental results showed that the algorithm performs well in improving the color bias and blurring of underwater images,with PSNR reaching 27.835,SSIM reaching 0.883,UIQM reaching 3.205,and UCIQE reaching 0.713.The enhanced image outperforms the comparison algorithm in both subjective and objective metrics.
文摘Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)techniques for DDoS attack diagnosis normally apply network traffic statistical features such as packet sizes and inter-arrival times.However,such techniques sometimes fail to capture complicated relations among various traffic flows.In this paper,we present a new multi-scale ensemble strategy given the Graph Neural Networks(GNNs)for improving DDoS detection.Our technique divides traffic into macro-and micro-level elements,letting various GNN models to get the two corase-scale anomalies and subtle,stealthy attack models.Through modeling network traffic as graph-structured data,GNNs efficiently learn intricate relations among network entities.The proposed ensemble learning algorithm combines the results of several GNNs to improve generalization,robustness,and scalability.Extensive experiments on three benchmark datasets—UNSW-NB15,CICIDS2017,and CICDDoS2019—show that our approach outperforms traditional machine learning and deep learning models in detecting both high-rate and low-rate(stealthy)DDoS attacks,with significant improvements in accuracy and recall.These findings demonstrate the suggested method’s applicability and robustness for real-world implementation in contexts where several DDoS patterns coexist.
基金supported by the National Natural Science Foundation of China(62173002,62403235,62403010,52301408,62173255)the Beijing Natural Science Foundation(L241015,4222045)+2 种基金the Yuxiu Innovation Project of NCUT(2024NCUTYXCX111)the China Postdoctoral Science Foundation(2025T180466)the Beijing Postdoctoral Research Foundation(2025-ZZ-70)。
文摘Networked predictive control(NPC) has gained significant attention in recent years for its ability to effectively and actively address communication constraints in networked control systems(NCSs),such as network-induced delays,packet dropouts,and packet disorders.Despite significant advancements,the increasing complexity and dynamism of network environments,along with the growing complexity of systems,pose new challenges for NPC.These challenges include difficulties in system modeling,cyber attacks,component faults,limited network bandwidth,and the necessity for distributed collaboration.This survey aims to provide a comprehensive review of NPC strategies.It begins with a summary of the primary challenges faced by NCSs,followed by an introduction to the control structure and core concepts of NPC.The survey then discusses several typical NPC schemes and examines their extensions in the areas of secure control,fault-tolerant control,distributed coordinated control,and event-triggered control.Moreover,it reviews notable works that have implemented these schemes.Finally,the survey concludes by exploring typical applications of NPC schemes and highlighting several challenging issues that could guide future research efforts.
文摘A multi-stimuli-responsive hydrogel,P(VI-co-MAAC-NE),was successfully constructed by covalently integrating the aggregation-induced emission(AIE)moiety(Z)-N-(4-(1-cyano-2-(4-(diethylamino)phenyl)vinyl)-phenyl)methacrylamide(NE)into a dynamic hydrogen-bonding network composed of 1-vinylimidazole(VI)and methacrylic acid(MAAC)groups.The dense hydrogen-bonding network not only provides enhanced mechanical robustness,but also significantly enhances the AIE effect of NE by restricting its molecular motion.Under various external stimuli,the hydrogen bonds within the hydrogel network undergo reversible dissociation and reformation,thus enabling synergistic modulation of the hydrogel’s mechanical properties and luminescence behavior.Specifically,organic solvents disrupt the hydrogen-bonding network and the aggregation of the AIE moiety NE,resulting in macroscopic swelling and fluorescence quenching of the hydrogel.In strongly acidic conditions,protonation of NE molecules suppresses the intramolecular charge transfer(ICT)process,yielding a blue-shifted emission band accompanied by intense blue fluorescence;in highly alkaline environments,deprotonation of carboxyl groups induces hydrogel swelling and disperses NE aggregates,leading to pronounced fluorescence quenching.Moreover,the system exhibits thermally activated shape-memory behavior:heating above the glass transition temperature(T_(g):ca.62℃)softens the hydrogel to allow programmable reshaping,and subsequent hydrogen bond reformation at ambient conditions locks in the resultant geometries without sacrificing the hydrogel’s fluorescence performance.By capitalizing on these multi-stimuli-responsive characteristics and shape-memory behavior,the potential of hydrogel P(VI-co-MAAC-NE)for advanced information encryption and anti-counterfeiting applications is demonstrated.This work not only provides a versatile material platform for sensing and information storage,but also offers new insights into the design of intelligent soft materials integrating AIE features with dynamically regulated supramolecular network structures.
基金supported by Yunnan Fundamental Research Projects(202501BD070001-081).
文摘Urbanization is a significant driver of the loss of biodiversity and the disruption of ecosystems.Amphibians are especially vulnerable to the negative impact of urbanization as their life cycles and habitat requirements are complex.The present study investigated the effects of urbanization on amphibian predation networks in suburban Kunming in Yunnan,China and aimed to understand how predation network structure and stability vary with urbanization level.We constructed predation networks by analyzing the stomach contents of amphibians from 12d istinct urbanization gradients.We used the bipartite package in R to evaluate network robustness metrics such as modularity,nestedness,connectivity,and average shortest path length(ASPL).We found that urbanization level is negatively correlated with predation network connectivity(R=−0.67,Ρ=0.02),but there were no significant correlations between urbanization level and nestedness,modularity,or ASPL.Removal of the keystone species destabilized the predation networks at certain locations.The present work highlighted that maintaining prey quantity and diversity preserves predation network connectivity and stabilizes the overall network in urbanizing landscapes.It also underscored the critical role that keystone species play in sustaining network robustness.The results of this research provided insights into the ecological consequences of urbanization.They also suggested that conservation measures should protect the key species and habitats of amphibian predation networks and mitigate the negative impact of urban development on them.
基金supported by the National Key Research and Development Program of China under Grant 2023YFB2903902in part by the Science and Technology Innovation Leading Talents Subsidy Project of Central Plains under Grant 244200510038.
文摘In the process of programmable networks simplifying network management and increasing network flexibility through custom packet behavior,security incidents caused by human logic errors are seriously threatening their safe operation,robust verificationmethods are required to ensure their correctness.As one of the formalmethods,symbolic execution offers a viable approach for verifying programmable networks by systematically exploring all possible paths within a program.However,its application in this field encounters scalability issues due to path explosion and complex constraint-solving.Therefore,in this paper,we propose NetVerifier,a scalable verification system for programmable networks.Tomitigate the path explosion issue,we developmultiple pruning strategies that strategically eliminate irrelevant execution paths while preserving verification integrity by precisely identifying the execution paths related to the verification purpose.To address the complex constraint-solving problem,we introduce an execution results reuse solution to avoid redundant computation of the same constraints.To apply these solutions intelligently,a matching algorithm is implemented to automatically select appropriate solutions based on the characteristics of the verification requirement.Moreover,Language Aided Verification(LAV),an assertion language,is designed to express verification intentions in a concise form.Experimental results on diverse open-source programs of varying scales demonstrate NetVerifier’s improvement in scalability and effectiveness in identifying potential network errors.In the best scenario,compared with ASSERT-P4,NetVerifier reduced the execution path,verification time,and memory occupation of the verification process by 99.92%,94.76%,and 65.19%,respectively.
基金Supported by the National key research and development program in the 14th five year plan 2021YFA1200700)the National Natural Science Foundation of China(62535018,62431025,62561160113)the Natural Science Foundation of Shanghai(23ZR1473400).
文摘Near-infrared image sensors are widely used in fields such as material identification,machine vision,and autonomous driving.Lead sulfide colloidal quantum dot-based infrared photodiodes can be integrated with sil⁃icon-based readout circuits in a single step.Based on this,we propose a photodiode based on an n-i-p structure,which removes the buffer layer and further simplifies the manufacturing process of quantum dot image sensors,thus reducing manufacturing costs.Additionally,for the noise complexity in quantum dot image sensors when capturing images,traditional denoising and non-uniformity methods often do not achieve optimal denoising re⁃sults.For the noise and stripe-type non-uniformity commonly encountered in infrared quantum dot detector imag⁃es,a network architecture has been developed that incorporates multiple key modules.This network combines channel attention and spatial attention mechanisms,dynamically adjusting the importance of feature maps to en⁃hance the ability to distinguish between noise and details.Meanwhile,the residual dense feature fusion module further improves the network's ability to process complex image structures through hierarchical feature extraction and fusion.Furthermore,the pyramid pooling module effectively captures information at different scales,improv⁃ing the network's multi-scale feature representation ability.Through the collaborative effect of these modules,the network can better handle various mixed noise and image non-uniformity issues.Experimental results show that it outperforms the traditional U-Net network in denoising and image correction tasks.
文摘Identifying the community structure of complex networks is crucial to extracting insights and understanding network properties.Although several community detection methods have been proposed,many are unsuitable for social networks due to significant limitations.Specifically,most approaches depend mainly on user-user structural links while overlooking service-centric,semantic,and multi-attribute drivers of community formation,and they also lack flexible filtering mechanisms for large-scale,service-oriented settings.Our proposed approach,called community discovery-based service(CDBS),leverages user profiles and their interactions with consulted web services.The method introduces a novel similarity measure,global similarity interaction profile(GSIP),which goes beyond typical similarity measures by unifying user and service profiles for all attributes types into a coherent representation,thereby clarifying its novelty and contribution.It applies multiple filtering criteria related to user attributes,accessed services,and interaction patterns.Experimental comparisons against Louvain,Hierarchical Agglomerative Clustering,Label Propagation and Infomap show that CDBS reveals the higher performance as it achieves 0.74 modularity,0.13 conductance,0.77 coverage,and significantly fast response time of 9.8 s,even with 10,000 users and 400 services.Moreover,community discoverybased service consistently detects a larger number of communities with distinct topics of interest,underscoring its capacity to generate detailed and efficient structures in complex networks.These results confirm both the efficiency and effectiveness of the proposed method.Beyond controlled evaluation,communities discovery based service is applicable to targeted recommendations,group-oriented marketing,access control,and service personalization,where communities are shaped not only by user links but also by service engagement.
基金supported by the Research year project of the KongjuNational University in 2025 and the Institute of Information&Communications Technology Planning&Evaluation(IITP)grant funded by the Korea government(MSIT)(No.RS-2024-00444170,Research and International Collaboration on Trust Model-Based Intelligent Incident Response Technologies in 6G Open Network Environment).
文摘With the growing complexity and decentralization of network systems,the attack surface has expanded,which has led to greater concerns over network threats.In this context,artificial intelligence(AI)-based network intrusion detection systems(NIDS)have been extensively studied,and recent efforts have shifted toward integrating distributed learning to enable intelligent and scalable detection mechanisms.However,most existing works focus on individual distributed learning frameworks,and there is a lack of systematic evaluations that compare different algorithms under consistent conditions.In this paper,we present a comprehensive evaluation of representative distributed learning frameworks—Federated Learning(FL),Split Learning(SL),hybrid collaborative learning(SFL),and fully distributed learning—in the context of AI-driven NIDS.Using recent benchmark intrusion detection datasets,a unified model backbone,and controlled distributed scenarios,we assess these frameworks across multiple criteria,including detection performance,communication cost,computational efficiency,and convergence behavior.Our findings highlight distinct trade-offs among the distributed learning frameworks,demonstrating that the optimal choice depends strongly on systemconstraints such as bandwidth availability,node resources,and data distribution.This work provides the first holistic analysis of distributed learning approaches for AI-driven NIDS and offers practical guidelines for designing secure and efficient intrusion detection systems in decentralized environments.
基金National Natural Science Foundation of China(Grant No.62103434)National Science Fund for Distinguished Young Scholars(Grant No.62176263).
文摘With network attack technology continuing to develop,traditional anomaly traffic detection methods that rely on feature engineering are increasingly insufficient in efficiency and accuracy.Graph Neural Network(GNN),a promising Deep Learning(DL)approach,has proven to be highly effective in identifying intricate patterns in graph⁃structured data and has already found wide applications in the field of network security.In this paper,we propose a hybrid Graph Convolutional Network(GCN)⁃GraphSAGE model for Anomaly Traffic Detection,namely HGS⁃ATD,which aims to improve the accuracy of anomaly traffic detection by leveraging edge feature learning to better capture the relationships between network entities.We validate the HGS⁃ATD model on four publicly available datasets,including NF⁃UNSW⁃NB15⁃v2.The experimental results show that the enhanced hybrid model is 5.71%to 10.25%higher than the baseline model in terms of accuracy,and the F1⁃score is 5.53%to 11.63%higher than the baseline model,proving that the model can effectively distinguish normal traffic from attack traffic and accurately classify various types of attacks.
