This paper investigates the traffic offloading optimization challenge in Space-Air-Ground Integrated Networks(SAGIN)through a novel Recursive Multi-Agent Proximal Policy Optimization(RMAPPO)algorithm.The exponential g...This paper investigates the traffic offloading optimization challenge in Space-Air-Ground Integrated Networks(SAGIN)through a novel Recursive Multi-Agent Proximal Policy Optimization(RMAPPO)algorithm.The exponential growth of mobile devices and data traffic has substantially increased network congestion,particularly in urban areas and regions with limited terrestrial infrastructure.Our approach jointly optimizes unmanned aerial vehicle(UAV)trajectories and satellite-assisted offloading strategies to simultaneously maximize data throughput,minimize energy consumption,and maintain equitable resource distribution.The proposed RMAPPO framework incorporates recurrent neural networks(RNNs)to model temporal dependencies in UAV mobility patterns and utilizes a decentralized multi-agent reinforcement learning architecture to reduce communication overhead while improving system robustness.The proposed RMAPPO algorithm was evaluated through simulation experiments,with the results indicating that it significantly enhances the cumulative traffic offloading rate of nodes and reduces the energy consumption of UAVs.展开更多
It has been argued that the human brain,as an information-processing machine,operates near a phase transition point in a non-equilibrium state,where it violates detailed balance leading to entropy production.Thus,the ...It has been argued that the human brain,as an information-processing machine,operates near a phase transition point in a non-equilibrium state,where it violates detailed balance leading to entropy production.Thus,the assessment of irreversibility in brain networks can provide valuable insights into their non-equilibrium properties.In this study,we utilized an open-source whole-brain functional magnetic resonance imaging(fMRI)dataset from both resting and task states to evaluate the irreversibility of large-scale human brain networks.Our analysis revealed that the brain networks exhibited significant irreversibility,violating detailed balance,and generating entropy.Notably,both physical and cognitive tasks increased the extent of this violation compared to the resting state.Regardless of the state(rest or task),interactions between pairs of brain regions were the primary contributors to this irreversibility.Moreover,we observed that as global synchrony increased within brain networks,so did irreversibility.The first derivative of irreversibility with respect to synchronization peaked near the phase transition point,characterized by the moderate mean synchronization and maximized synchronization entropy of blood oxygenation level-dependent(BOLD)signals.These findings deepen our understanding of the non-equilibrium dynamics of large-scale brain networks,particularly in relation to their phase transition behaviors,and may have potential clinical applications for brain disorders.展开更多
The dynamic behaviors of a large-scale ring neural network with a triangular coupling structure are investigated.The characteristic equation of the high-dimensional system using Coate’s flow graph method is calculate...The dynamic behaviors of a large-scale ring neural network with a triangular coupling structure are investigated.The characteristic equation of the high-dimensional system using Coate’s flow graph method is calculated.Time delay is selected as the bifurcation parameter,and sufficient conditions for stability and Hopf bifurcation are derived.It is found that the connection coefficient and time delay play a crucial role in the dynamic behaviors of the model.Furthermore,a phase diagram of multiple equilibrium points with one saddle point and two stable nodes is presented.Finally,the effectiveness of the theory is verified through simulation results.展开更多
A Long Short-Term Memory(LSTM) Recurrent Neural Network(RNN) has driven tremendous improvements on an acoustic model based on Gaussian Mixture Model(GMM). However, these models based on a hybrid method require a force...A Long Short-Term Memory(LSTM) Recurrent Neural Network(RNN) has driven tremendous improvements on an acoustic model based on Gaussian Mixture Model(GMM). However, these models based on a hybrid method require a forced aligned Hidden Markov Model(HMM) state sequence obtained from the GMM-based acoustic model. Therefore, it requires a long computation time for training both the GMM-based acoustic model and a deep learning-based acoustic model. In order to solve this problem, an acoustic model using CTC algorithm is proposed. CTC algorithm does not require the GMM-based acoustic model because it does not use the forced aligned HMM state sequence. However, previous works on a LSTM RNN-based acoustic model using CTC used a small-scale training corpus. In this paper, the LSTM RNN-based acoustic model using CTC is trained on a large-scale training corpus and its performance is evaluated. The implemented acoustic model has a performance of 6.18% and 15.01% in terms of Word Error Rate(WER) for clean speech and noisy speech, respectively. This is similar to a performance of the acoustic model based on the hybrid method.展开更多
As a result of rapid development in electronics and communication technology,large-scale unmanned aerial vehicles(UAVs)are harnessed for various promising applications in a coordinated manner.Although it poses numerou...As a result of rapid development in electronics and communication technology,large-scale unmanned aerial vehicles(UAVs)are harnessed for various promising applications in a coordinated manner.Although it poses numerous advantages,resource management among various domains in large-scale UAV communication networks is the key challenge to be solved urgently.Specifically,due to the inherent requirements and future development trend,distributed resource management is suitable.In this article,we investigate the resource management problem for large-scale UAV communication networks from game-theoretic perspective which are exactly coincident with the distributed and autonomous manner.By exploring the inherent features,the distinctive challenges are discussed.Then,we explore several gametheoretic models that not only combat the challenges but also have broad application prospects.We provide the basics of each game-theoretic model and discuss the potential applications for resource management in large-scale UAV communication networks.Specifically,mean-field game,graphical game,Stackelberg game,coalition game and potential game are included.After that,we propose two innovative case studies to highlight the feasibility of such novel game-theoretic models.Finally,we give some future research directions to shed light on future opportunities and applications.展开更多
Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization.Compared with other studies which focus on designing heurist...Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization.Compared with other studies which focus on designing heuristic algorithms to reduce the hardness of the NP-hard problem we propose a robust VNE algorithm based on component connectivity in large-scale network.We distinguish the different components and embed VN requests onto them respectively.And k-core is applied to identify different VN topologies so that the VN request can be embedded onto its corresponding component.On the other hand,load balancing is also considered in this paper.It could avoid blocked or bottlenecked area of substrate network.Simulation experiments show that compared with other algorithms in large-scale network,acceptance ratio,average revenue and robustness can be obviously improved by our algorithm and average cost can be reduced.It also shows the relationship between the component connectivity including giant component and small components and the performance metrics.展开更多
With the emphasis on user privacy and communication security, encrypted traffic has increased dramatically, which brings great challenges to traffic classification. The classification method of encrypted traffic based...With the emphasis on user privacy and communication security, encrypted traffic has increased dramatically, which brings great challenges to traffic classification. The classification method of encrypted traffic based on GNN can deal with encrypted traffic well. However, existing GNN-based approaches ignore the relationship between client or server packets. In this paper, we design a network traffic topology based on GCN, called Flow Mapping Graph (FMG). FMG establishes sequential edges between vertexes by the arrival order of packets and establishes jump-order edges between vertexes by connecting packets in different bursts with the same direction. It not only reflects the time characteristics of the packet but also strengthens the relationship between the client or server packets. According to FMG, a Traffic Mapping Classification model (TMC-GCN) is designed, which can automatically capture and learn the characteristics and structure information of the top vertex in FMG. The TMC-GCN model is used to classify the encrypted traffic. The encryption stream classification problem is transformed into a graph classification problem, which can effectively deal with data from different data sources and application scenarios. By comparing the performance of TMC-GCN with other classical models in four public datasets, including CICIOT2023, ISCXVPN2016, CICAAGM2017, and GraphDapp, the effectiveness of the FMG algorithm is verified. The experimental results show that the accuracy rate of the TMC-GCN model is 96.13%, the recall rate is 95.04%, and the F1 rate is 94.54%.展开更多
With an increasing urgent demand for fast recovery routing mechanisms in large-scale networks,minimizing network disruption caused by network failure has become critical.However,a large number of relevant studies have...With an increasing urgent demand for fast recovery routing mechanisms in large-scale networks,minimizing network disruption caused by network failure has become critical.However,a large number of relevant studies have shown that network failures occur on the Internet inevitably and frequently.The current routing protocols deployed on the Internet adopt the reconvergence mechanism to cope with network failures.During the reconvergence process,the packets may be lost because of inconsistent routing information,which reduces the network’s availability greatly and affects the Internet service provider’s(ISP’s)service quality and reputation seriously.Therefore,improving network availability has become an urgent problem.As such,the Internet Engineering Task Force suggests the use of downstream path criterion(DC)to address all single-link failure scenarios.However,existing methods for implementing DC schemes are time consuming,require a large amount of router CPU resources,and may deteriorate router capability.Thus,the computation overhead introduced by existing DC schemes is significant,especially in large-scale networks.Therefore,this study proposes an efficient intra-domain routing protection algorithm(ERPA)in large-scale networks.Theoretical analysis indicates that the time complexity of ERPA is less than that of constructing a shortest path tree.Experimental results show that ERPA can reduce the computation overhead significantly compared with the existing algorithms while offering the same network availability as DC.展开更多
WiFi has become one of the most popular ways to access the Internet.However,in large-scale campus wireless networks,it is challenging for network administrators to provide optimized access quality without knowledge on...WiFi has become one of the most popular ways to access the Internet.However,in large-scale campus wireless networks,it is challenging for network administrators to provide optimized access quality without knowledge on fine-grained traffic characteristics and real network performance.In this paper,we implement PerfMon,a network performance measurement and diagnosis system,which integrates collected multi-source datasets and analysis methods.Based on PerfMon,we first conduct a comprehensive measurement on application-level traffic patterns and behaviors from multiple dimensions in the wireless network of T university(TWLAN),which is one of the largest campus wireless networks.Then we systematically study the application-level network performance.We observe that the application-level traffic behaviors and performance vary greatly across different locations and device types.The performance is far from satisfactory in some cases.To diagnose these problems,we distinguish locations and device types,and further locate the most crucial factors that affect the performance.The results of case studies show that the influential factors can effectively characterize performance changes and explain for performance degradation.展开更多
By considering the flow control of urban sewer networks to minimize the electricity consumption of pumping stations, a decomposition-coordination strategy for energy savings based on network community division is deve...By considering the flow control of urban sewer networks to minimize the electricity consumption of pumping stations, a decomposition-coordination strategy for energy savings based on network community division is developed in this paper. A mathematical model characterizing the steady-state flow of urban sewer networks is first constructed, consisting of a set of algebraic equations with the structure transportation capacities captured as constraints. Since the sewer networks have no apparent natural hierarchical structure in general, it is very difficult to identify the clustered groups. A fast network division approach through calculating the betweenness of each edge is successfully applied to identify the groups and a sewer network with arbitrary configuration could be then decomposed into subnetworks. By integrating the coupling constraints of the subnetworks, the original problem is separated into N optimization subproblems in accordance with the network decomposition. Each subproblem is solved locally and the solutions to the subproblems are coordinated to form an appropriate global solution. Finally, an application to a specified large-scale sewer network is also investigated to demonstrate the validity of the proposed algorithm.展开更多
With the purpose of making calculation more efficient in practical hydraulic simulations, an improved algorithm was proposed and was applied in the practical water distribution field. This methodology was developed by...With the purpose of making calculation more efficient in practical hydraulic simulations, an improved algorithm was proposed and was applied in the practical water distribution field. This methodology was developed by expanding the traditional loop-equation theory through utilization of the advantages of the graph theory in efficiency. The utilization of the spanning tree technique from graph theory makes the proposed algorithm efficient in calculation and simple to use for computer coding. The algorithms for topological generation and practical implementations are presented in detail in this paper. Through the application to a practical urban system, the consumption of the CPU time and computation memory were decreased while the accuracy was greatly enhanced compared with the present existing methods.展开更多
Network traffic classification is a crucial research area aimed at improving quality of service,simplifying network management,and enhancing network security.To address the growing complexity of cryptography,researche...Network traffic classification is a crucial research area aimed at improving quality of service,simplifying network management,and enhancing network security.To address the growing complexity of cryptography,researchers have proposed various machine learning and deep learning approaches to tackle this challenge.However,existing mainstream methods face several general issues.On one hand,the widely used Transformer architecture exhibits high computational complexity,which negatively impacts its efficiency.On the other hand,traditional methods are often unreliable in traffic representation,frequently losing important byte information while retaining unnecessary biases.To address these problems,this paper introduces the Swin Transformer architecture into the domain of network traffic classification and proposes the NetST(Network Swin Transformer)model.This model improves the Swin Transformer to better accommodate the characteristics of network traffic,effectively addressing efficiency issues.Furthermore,this paper presents a traffic representation scheme designed to extract meaningful information from large volumes of traffic while minimizing bias.We integrate four datasets relevant to network traffic classification for our experiments,and the results demonstrate that NetST achieves a high accuracy rate while maintaining low memory usage.展开更多
Low-carbon smart parks achieve selfbalanced carbon emission and absorption through the cooperative scheduling of direct current(DC)-based distributed photovoltaic,energy storage units,and loads.Direct current power li...Low-carbon smart parks achieve selfbalanced carbon emission and absorption through the cooperative scheduling of direct current(DC)-based distributed photovoltaic,energy storage units,and loads.Direct current power line communication(DC-PLC)enables real-time data transmission on DC power lines.With traffic adaptation,DC-PLC can be integrated with other complementary media such as 5G to reduce transmission delay and improve reliability.However,traffic adaptation for DC-PLC and 5G integration still faces the challenges such as coupling between traffic admission control and traffic partition,dimensionality curse,and the ignorance of extreme event occurrence.To address these challenges,we propose a deep reinforcement learning(DRL)-based delay sensitive and reliable traffic adaptation algorithm(DSRTA)to minimize the total queuing delay under the constraints of traffic admission control,queuing delay,and extreme events occurrence probability.DSRTA jointly optimizes traffic admission control and traffic partition,and enables learning-based intelligent traffic adaptation.The long-term constraints are incorporated into both state and bound of drift-pluspenalty to achieve delay awareness and enforce reliability guarantee.Simulation results show that DSRTA has lower queuing delay and more reliable quality of service(QoS)guarantee than other state-of-the-art algorithms.展开更多
Dear Editor,This letter proposes a dynamic switching soft slicing strategy for industrial mixed traffic in 5G networks. Considering two types of traffic, periodic delay-sensitive (PDS) traffic and sporadic delay-toler...Dear Editor,This letter proposes a dynamic switching soft slicing strategy for industrial mixed traffic in 5G networks. Considering two types of traffic, periodic delay-sensitive (PDS) traffic and sporadic delay-tolerant (SDT) traffic, we design a dynamic switching strategy based on a traffic-Qo S-aware soft slicing (TQASS) scheme and a resource-efficiency-aware soft slicing (REASS) scheme.展开更多
Accurate traffic flow prediction has a profound impact on modern traffic management. Traffic flow has complex spatial-temporal correlations and periodicity, which poses difficulties for precise prediction. To address ...Accurate traffic flow prediction has a profound impact on modern traffic management. Traffic flow has complex spatial-temporal correlations and periodicity, which poses difficulties for precise prediction. To address this problem, a Multi-head Self-attention and Spatial-Temporal Graph Convolutional Network (MSSTGCN) for multiscale traffic flow prediction is proposed. Firstly, to capture the hidden traffic periodicity of traffic flow, traffic flow is divided into three kinds of periods, including hourly, daily, and weekly data. Secondly, a graph attention residual layer is constructed to learn the global spatial features across regions. Local spatial-temporal dependence is captured by using a T-GCN module. Thirdly, a transformer layer is introduced to learn the long-term dependence in time. A position embedding mechanism is introduced to label position information for all traffic sequences. Thus, this multi-head self-attention mechanism can recognize the sequence order and allocate weights for different time nodes. Experimental results on four real-world datasets show that the MSSTGCN performs better than the baseline methods and can be successfully adapted to traffic prediction tasks.展开更多
Traffic congestion plays a significant role in intelligent transportation systems(ITS)due to rapid urbanization and increased vehicle concentration.The congestion is dependent on multiple factors,such as limited road ...Traffic congestion plays a significant role in intelligent transportation systems(ITS)due to rapid urbanization and increased vehicle concentration.The congestion is dependent on multiple factors,such as limited road occupancy and vehicle density.Therefore,the transportation system requires an effective prediction model to reduce congestion issues in a dynamic environment.Conventional prediction systems face difficulties in identifying highly congested areas,which leads to reduced prediction accuracy.The problem is addressed by integrating Graph Neural Networks(GNN)with the Lion Swarm Optimization(LSO)framework to tackle the congestion prediction problem.Initially,the traffic information is collected and processed through a normalization process to scale the data and mitigate issues of overfitting and high dimensionality.Then,the traffic flow and temporal characteristic features are extracted to identify the connectivity of the road segment.From the connectivity and node relationship graph,modeling improves the overall prediction accuracy.During the analysis,the lion swarm optimization process utilizes the concepts of exploration and exploitation to understand the complex traffic dependencies,which helps predict high congestion on roads with minimal deviation errors.There are three core optimization phases:roaming,hunting,and migration,which enable the framework to make dynamic adjustments to enhance the predictions.The framework’s efficacy is evaluated using benchmark datasets,where the proposed work achieves 99.2%accuracy and minimizes the prediction deviation value by up to 2.5%compared to other methods.With the new framework,there was a more accurate prediction of realtime congestion,lower computational cost,and improved regulation of traffic flow.This system is easily implemented in intelligent transportation systems,smart cities,and self-driving cars,providing a robust and scalable solution for future traffic management.展开更多
In recent years,load balancing routing al-gorithms have been extensively studied in satellite net-works.Most existing studies focus on path selection and hop-count optimization for end-to-end transmis-sion,while overl...In recent years,load balancing routing al-gorithms have been extensively studied in satellite net-works.Most existing studies focus on path selection and hop-count optimization for end-to-end transmis-sion,while overlooking congestion issues on feeder links caused by the limited number and centralized distribution of ground stations.Hence,a multi-service routing algorithm called the Multi-service Load Bal-ancing Routing Algorithm for Traffic Return(MLB-TR)is proposed.Unlike traditional approaches,MLB-TR aims to achieve a broader and more comprehensive load balancing objective.Specifically,based on the service type,an appropriate landing satellite is first selected by considering factors such as shortest path hop count and satellite load.Then,a set of candidate paths from the source satellite to the selected landing satellite is computed.Finally,using the regional load balancing index as the optimization objective,the final transmission path is selected from the candidate path set.Simulation results show that the proposed algo-rithm outperforms the existing works.展开更多
Urban traffic prediction with high precision is always the unremitting pursuit of intelligent transportation systems and is instrumental in bringing smart cities into reality.The fundamental challenges for traffic pre...Urban traffic prediction with high precision is always the unremitting pursuit of intelligent transportation systems and is instrumental in bringing smart cities into reality.The fundamental challenges for traffic prediction lie in the accurate modelling of spatial and temporal traffic dynamics.Existing approaches mainly focus on modelling the traffic data itself,but do not explore the traffic correlations implicit in origin-destination(OD)data.In this paper,we propose STOD-Net,a dynamic spatial-temporal OD feature-enhanced deep network,to simultaneously predict the in-traffic and out-traffic for each and every region of a city.We model the OD data as dynamic graphs and adopt graph neural networks in STOD-Net to learn a low-dimensional representation for each region.As per the region feature,we design a gating mechanism and operate it on the traffic feature learning to explicitly capture spatial correlations.To further capture the complicated spatial and temporal dependencies among different regions,we propose a novel joint feature,learning block in STOD-Net and transfer the hybrid OD features to each block to make the learning process spatiotemporal-aware.We evaluate the effectiveness of STOD-Net on two benchmark datasets,and experimental results demonstrate that it outperforms the state-of-the-art by approximately 5%in terms of prediction accuracy and considerably improves prediction stability up to 80%in terms of standard deviation.展开更多
The integration of cloud computing into traditional industrial control systems is accelerating the evolution of Industrial Cyber-Physical System(ICPS),enhancing intelligence and autonomy.However,this transition also e...The integration of cloud computing into traditional industrial control systems is accelerating the evolution of Industrial Cyber-Physical System(ICPS),enhancing intelligence and autonomy.However,this transition also expands the attack surface,introducing critical security vulnerabilities.To address these challenges,this article proposes a hybrid intrusion detection scheme for securing ICPSs that combines system state anomaly and network traffic anomaly detection.Specifically,an improved variation-Bayesian-based noise covariance-adaptive nonlinear Kalman filtering(IVB-NCA-NLKF)method is developed to model nonlinear system dynamics,enabling optimal state estimation in multi-sensor ICPS environments.Intrusions within the physical sensing system are identified by analyzing residual discrepancies between predicted and observed system states.Simultaneously,an adaptive network traffic anomaly detection mechanism is introduced,leveraging learned traffic patterns to detect node-and network-level anomalies through pattern matching.Extensive experiments on a simulated network control system demonstrate that the proposed framework achieves higher detection accuracy(92.14%)with a reduced false alarm rate(0.81%).Moreover,it not only detects known attacks and vulnerabilities but also uncovers stealthy attacks that induce system state deviations,providing a robust and comprehensive security solution for the safety protection of ICPS.展开更多
With the rise of encrypted traffic,traditional network analysis methods have become less effective,leading to a shift towards deep learning-based approaches.Among these,multimodal learning-based classification methods...With the rise of encrypted traffic,traditional network analysis methods have become less effective,leading to a shift towards deep learning-based approaches.Among these,multimodal learning-based classification methods have gained attention due to their ability to leverage diverse feature sets from encrypted traffic,improving classification accuracy.However,existing research predominantly relies on late fusion techniques,which hinder the full utilization of deep features within the data.To address this limitation,we propose a novel multimodal encrypted traffic classification model that synchronizes modality fusion with multiscale feature extraction.Specifically,our approach performs real-time fusion of modalities at each stage of feature extraction,enhancing feature representation at each level and preserving inter-level correlations for more effective learning.This continuous fusion strategy improves the model’s ability to detect subtle variations in encrypted traffic,while boosting its robustness and adaptability to evolving network conditions.Experimental results on two real-world encrypted traffic datasets demonstrate that our method achieves a classification accuracy of 98.23% and 97.63%,outperforming existing multimodal learning-based methods.展开更多
文摘This paper investigates the traffic offloading optimization challenge in Space-Air-Ground Integrated Networks(SAGIN)through a novel Recursive Multi-Agent Proximal Policy Optimization(RMAPPO)algorithm.The exponential growth of mobile devices and data traffic has substantially increased network congestion,particularly in urban areas and regions with limited terrestrial infrastructure.Our approach jointly optimizes unmanned aerial vehicle(UAV)trajectories and satellite-assisted offloading strategies to simultaneously maximize data throughput,minimize energy consumption,and maintain equitable resource distribution.The proposed RMAPPO framework incorporates recurrent neural networks(RNNs)to model temporal dependencies in UAV mobility patterns and utilizes a decentralized multi-agent reinforcement learning architecture to reduce communication overhead while improving system robustness.The proposed RMAPPO algorithm was evaluated through simulation experiments,with the results indicating that it significantly enhances the cumulative traffic offloading rate of nodes and reduces the energy consumption of UAVs.
基金supported by the Fundamental Research Funds for the Central Universities(Grant Nos.lzujbky-2021-62 and lzujbky-2024-jdzx06)the National Natural Science Foundation of China(Grant No.12247101)+1 种基金the Natural Science Foundation of Gansu Province,China(Grant Nos.22JR5RA389 and 23JRRA1740)the‘111 Center’Fund(Grant No.B20063).
文摘It has been argued that the human brain,as an information-processing machine,operates near a phase transition point in a non-equilibrium state,where it violates detailed balance leading to entropy production.Thus,the assessment of irreversibility in brain networks can provide valuable insights into their non-equilibrium properties.In this study,we utilized an open-source whole-brain functional magnetic resonance imaging(fMRI)dataset from both resting and task states to evaluate the irreversibility of large-scale human brain networks.Our analysis revealed that the brain networks exhibited significant irreversibility,violating detailed balance,and generating entropy.Notably,both physical and cognitive tasks increased the extent of this violation compared to the resting state.Regardless of the state(rest or task),interactions between pairs of brain regions were the primary contributors to this irreversibility.Moreover,we observed that as global synchrony increased within brain networks,so did irreversibility.The first derivative of irreversibility with respect to synchronization peaked near the phase transition point,characterized by the moderate mean synchronization and maximized synchronization entropy of blood oxygenation level-dependent(BOLD)signals.These findings deepen our understanding of the non-equilibrium dynamics of large-scale brain networks,particularly in relation to their phase transition behaviors,and may have potential clinical applications for brain disorders.
基金Supported by Natural Science Foundation of Shandong Province of China(Grant Nos.ZR2020MF080 and ZR2020MF065).
文摘The dynamic behaviors of a large-scale ring neural network with a triangular coupling structure are investigated.The characteristic equation of the high-dimensional system using Coate’s flow graph method is calculated.Time delay is selected as the bifurcation parameter,and sufficient conditions for stability and Hopf bifurcation are derived.It is found that the connection coefficient and time delay play a crucial role in the dynamic behaviors of the model.Furthermore,a phase diagram of multiple equilibrium points with one saddle point and two stable nodes is presented.Finally,the effectiveness of the theory is verified through simulation results.
基金supported by the Ministry of Trade,Industry & Energy(MOTIE,Korea) under Industrial Technology Innovation Program (No.10063424,'development of distant speech recognition and multi-task dialog processing technologies for in-door conversational robots')
文摘A Long Short-Term Memory(LSTM) Recurrent Neural Network(RNN) has driven tremendous improvements on an acoustic model based on Gaussian Mixture Model(GMM). However, these models based on a hybrid method require a forced aligned Hidden Markov Model(HMM) state sequence obtained from the GMM-based acoustic model. Therefore, it requires a long computation time for training both the GMM-based acoustic model and a deep learning-based acoustic model. In order to solve this problem, an acoustic model using CTC algorithm is proposed. CTC algorithm does not require the GMM-based acoustic model because it does not use the forced aligned HMM state sequence. However, previous works on a LSTM RNN-based acoustic model using CTC used a small-scale training corpus. In this paper, the LSTM RNN-based acoustic model using CTC is trained on a large-scale training corpus and its performance is evaluated. The implemented acoustic model has a performance of 6.18% and 15.01% in terms of Word Error Rate(WER) for clean speech and noisy speech, respectively. This is similar to a performance of the acoustic model based on the hybrid method.
基金This work was supported by National Key R&D Program of China under Grant 2018YFB1800802in part by the National Natural Science Foundation of China under Grant No.61771488,No.61631020 and No.61827801+1 种基金in part by State Key Laboratory of Air Traffic Management System and Technology under Grant No.SKLATM201808in part by Postgraduate Research and Practice Innovation Program of Jiangsu Province under No.KYCX190188.
文摘As a result of rapid development in electronics and communication technology,large-scale unmanned aerial vehicles(UAVs)are harnessed for various promising applications in a coordinated manner.Although it poses numerous advantages,resource management among various domains in large-scale UAV communication networks is the key challenge to be solved urgently.Specifically,due to the inherent requirements and future development trend,distributed resource management is suitable.In this article,we investigate the resource management problem for large-scale UAV communication networks from game-theoretic perspective which are exactly coincident with the distributed and autonomous manner.By exploring the inherent features,the distinctive challenges are discussed.Then,we explore several gametheoretic models that not only combat the challenges but also have broad application prospects.We provide the basics of each game-theoretic model and discuss the potential applications for resource management in large-scale UAV communication networks.Specifically,mean-field game,graphical game,Stackelberg game,coalition game and potential game are included.After that,we propose two innovative case studies to highlight the feasibility of such novel game-theoretic models.Finally,we give some future research directions to shed light on future opportunities and applications.
基金supported in part by the National Natural Science Foundation of China under Grant No.61471055
文摘Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization.Compared with other studies which focus on designing heuristic algorithms to reduce the hardness of the NP-hard problem we propose a robust VNE algorithm based on component connectivity in large-scale network.We distinguish the different components and embed VN requests onto them respectively.And k-core is applied to identify different VN topologies so that the VN request can be embedded onto its corresponding component.On the other hand,load balancing is also considered in this paper.It could avoid blocked or bottlenecked area of substrate network.Simulation experiments show that compared with other algorithms in large-scale network,acceptance ratio,average revenue and robustness can be obviously improved by our algorithm and average cost can be reduced.It also shows the relationship between the component connectivity including giant component and small components and the performance metrics.
基金supported by the National Key Research and Development Program of China No.2023YFA1009500.
文摘With the emphasis on user privacy and communication security, encrypted traffic has increased dramatically, which brings great challenges to traffic classification. The classification method of encrypted traffic based on GNN can deal with encrypted traffic well. However, existing GNN-based approaches ignore the relationship between client or server packets. In this paper, we design a network traffic topology based on GCN, called Flow Mapping Graph (FMG). FMG establishes sequential edges between vertexes by the arrival order of packets and establishes jump-order edges between vertexes by connecting packets in different bursts with the same direction. It not only reflects the time characteristics of the packet but also strengthens the relationship between the client or server packets. According to FMG, a Traffic Mapping Classification model (TMC-GCN) is designed, which can automatically capture and learn the characteristics and structure information of the top vertex in FMG. The TMC-GCN model is used to classify the encrypted traffic. The encryption stream classification problem is transformed into a graph classification problem, which can effectively deal with data from different data sources and application scenarios. By comparing the performance of TMC-GCN with other classical models in four public datasets, including CICIOT2023, ISCXVPN2016, CICAAGM2017, and GraphDapp, the effectiveness of the FMG algorithm is verified. The experimental results show that the accuracy rate of the TMC-GCN model is 96.13%, the recall rate is 95.04%, and the F1 rate is 94.54%.
基金the National Natural Science Foundation of China(No.61702315)the Key R&D program(international science and technology cooperation project)of Shanxi Province China(No.201903D421003)the National Key Research and Development Program of China(No.2018YFB1800401).
文摘With an increasing urgent demand for fast recovery routing mechanisms in large-scale networks,minimizing network disruption caused by network failure has become critical.However,a large number of relevant studies have shown that network failures occur on the Internet inevitably and frequently.The current routing protocols deployed on the Internet adopt the reconvergence mechanism to cope with network failures.During the reconvergence process,the packets may be lost because of inconsistent routing information,which reduces the network’s availability greatly and affects the Internet service provider’s(ISP’s)service quality and reputation seriously.Therefore,improving network availability has become an urgent problem.As such,the Internet Engineering Task Force suggests the use of downstream path criterion(DC)to address all single-link failure scenarios.However,existing methods for implementing DC schemes are time consuming,require a large amount of router CPU resources,and may deteriorate router capability.Thus,the computation overhead introduced by existing DC schemes is significant,especially in large-scale networks.Therefore,this study proposes an efficient intra-domain routing protection algorithm(ERPA)in large-scale networks.Theoretical analysis indicates that the time complexity of ERPA is less than that of constructing a shortest path tree.Experimental results show that ERPA can reduce the computation overhead significantly compared with the existing algorithms while offering the same network availability as DC.
基金supported by the National Key Research and Development Program of China(No.2020YFE0200500)。
文摘WiFi has become one of the most popular ways to access the Internet.However,in large-scale campus wireless networks,it is challenging for network administrators to provide optimized access quality without knowledge on fine-grained traffic characteristics and real network performance.In this paper,we implement PerfMon,a network performance measurement and diagnosis system,which integrates collected multi-source datasets and analysis methods.Based on PerfMon,we first conduct a comprehensive measurement on application-level traffic patterns and behaviors from multiple dimensions in the wireless network of T university(TWLAN),which is one of the largest campus wireless networks.Then we systematically study the application-level network performance.We observe that the application-level traffic behaviors and performance vary greatly across different locations and device types.The performance is far from satisfactory in some cases.To diagnose these problems,we distinguish locations and device types,and further locate the most crucial factors that affect the performance.The results of case studies show that the influential factors can effectively characterize performance changes and explain for performance degradation.
基金the National Natural Science Foundation of China (No.60674041, 60504026)the National High Technology Project(No.2006AA04Z173).
文摘By considering the flow control of urban sewer networks to minimize the electricity consumption of pumping stations, a decomposition-coordination strategy for energy savings based on network community division is developed in this paper. A mathematical model characterizing the steady-state flow of urban sewer networks is first constructed, consisting of a set of algebraic equations with the structure transportation capacities captured as constraints. Since the sewer networks have no apparent natural hierarchical structure in general, it is very difficult to identify the clustered groups. A fast network division approach through calculating the betweenness of each edge is successfully applied to identify the groups and a sewer network with arbitrary configuration could be then decomposed into subnetworks. By integrating the coupling constraints of the subnetworks, the original problem is separated into N optimization subproblems in accordance with the network decomposition. Each subproblem is solved locally and the solutions to the subproblems are coordinated to form an appropriate global solution. Finally, an application to a specified large-scale sewer network is also investigated to demonstrate the validity of the proposed algorithm.
文摘With the purpose of making calculation more efficient in practical hydraulic simulations, an improved algorithm was proposed and was applied in the practical water distribution field. This methodology was developed by expanding the traditional loop-equation theory through utilization of the advantages of the graph theory in efficiency. The utilization of the spanning tree technique from graph theory makes the proposed algorithm efficient in calculation and simple to use for computer coding. The algorithms for topological generation and practical implementations are presented in detail in this paper. Through the application to a practical urban system, the consumption of the CPU time and computation memory were decreased while the accuracy was greatly enhanced compared with the present existing methods.
基金supported by National Natural Science Foundation of China(62473341)Key Technologies R&D Program of Henan Province(242102211071,252102211086,252102210166).
文摘Network traffic classification is a crucial research area aimed at improving quality of service,simplifying network management,and enhancing network security.To address the growing complexity of cryptography,researchers have proposed various machine learning and deep learning approaches to tackle this challenge.However,existing mainstream methods face several general issues.On one hand,the widely used Transformer architecture exhibits high computational complexity,which negatively impacts its efficiency.On the other hand,traditional methods are often unreliable in traffic representation,frequently losing important byte information while retaining unnecessary biases.To address these problems,this paper introduces the Swin Transformer architecture into the domain of network traffic classification and proposes the NetST(Network Swin Transformer)model.This model improves the Swin Transformer to better accommodate the characteristics of network traffic,effectively addressing efficiency issues.Furthermore,this paper presents a traffic representation scheme designed to extract meaningful information from large volumes of traffic while minimizing bias.We integrate four datasets relevant to network traffic classification for our experiments,and the results demonstrate that NetST achieves a high accuracy rate while maintaining low memory usage.
基金supported by the Science and Technology Project of State Grid Corporation of China under grant 52094021N010(5400-202199534A-0-5-ZN)。
文摘Low-carbon smart parks achieve selfbalanced carbon emission and absorption through the cooperative scheduling of direct current(DC)-based distributed photovoltaic,energy storage units,and loads.Direct current power line communication(DC-PLC)enables real-time data transmission on DC power lines.With traffic adaptation,DC-PLC can be integrated with other complementary media such as 5G to reduce transmission delay and improve reliability.However,traffic adaptation for DC-PLC and 5G integration still faces the challenges such as coupling between traffic admission control and traffic partition,dimensionality curse,and the ignorance of extreme event occurrence.To address these challenges,we propose a deep reinforcement learning(DRL)-based delay sensitive and reliable traffic adaptation algorithm(DSRTA)to minimize the total queuing delay under the constraints of traffic admission control,queuing delay,and extreme events occurrence probability.DSRTA jointly optimizes traffic admission control and traffic partition,and enables learning-based intelligent traffic adaptation.The long-term constraints are incorporated into both state and bound of drift-pluspenalty to achieve delay awareness and enforce reliability guarantee.Simulation results show that DSRTA has lower queuing delay and more reliable quality of service(QoS)guarantee than other state-of-the-art algorithms.
基金supported by the Liaoning Revitalization Talents Program(XLYC2203148)
文摘Dear Editor,This letter proposes a dynamic switching soft slicing strategy for industrial mixed traffic in 5G networks. Considering two types of traffic, periodic delay-sensitive (PDS) traffic and sporadic delay-tolerant (SDT) traffic, we design a dynamic switching strategy based on a traffic-Qo S-aware soft slicing (TQASS) scheme and a resource-efficiency-aware soft slicing (REASS) scheme.
基金supported by the National Natural Science Foundation of China(Grant Nos.62472149,62376089,62202147)Hubei Provincial Science and Technology Plan Project(2023BCB04100).
文摘Accurate traffic flow prediction has a profound impact on modern traffic management. Traffic flow has complex spatial-temporal correlations and periodicity, which poses difficulties for precise prediction. To address this problem, a Multi-head Self-attention and Spatial-Temporal Graph Convolutional Network (MSSTGCN) for multiscale traffic flow prediction is proposed. Firstly, to capture the hidden traffic periodicity of traffic flow, traffic flow is divided into three kinds of periods, including hourly, daily, and weekly data. Secondly, a graph attention residual layer is constructed to learn the global spatial features across regions. Local spatial-temporal dependence is captured by using a T-GCN module. Thirdly, a transformer layer is introduced to learn the long-term dependence in time. A position embedding mechanism is introduced to label position information for all traffic sequences. Thus, this multi-head self-attention mechanism can recognize the sequence order and allocate weights for different time nodes. Experimental results on four real-world datasets show that the MSSTGCN performs better than the baseline methods and can be successfully adapted to traffic prediction tasks.
基金Deanship of Graduate Studies and Scientific Research at Jouf University under grant No.(DGSSR-2025-02-01641)。
文摘Traffic congestion plays a significant role in intelligent transportation systems(ITS)due to rapid urbanization and increased vehicle concentration.The congestion is dependent on multiple factors,such as limited road occupancy and vehicle density.Therefore,the transportation system requires an effective prediction model to reduce congestion issues in a dynamic environment.Conventional prediction systems face difficulties in identifying highly congested areas,which leads to reduced prediction accuracy.The problem is addressed by integrating Graph Neural Networks(GNN)with the Lion Swarm Optimization(LSO)framework to tackle the congestion prediction problem.Initially,the traffic information is collected and processed through a normalization process to scale the data and mitigate issues of overfitting and high dimensionality.Then,the traffic flow and temporal characteristic features are extracted to identify the connectivity of the road segment.From the connectivity and node relationship graph,modeling improves the overall prediction accuracy.During the analysis,the lion swarm optimization process utilizes the concepts of exploration and exploitation to understand the complex traffic dependencies,which helps predict high congestion on roads with minimal deviation errors.There are three core optimization phases:roaming,hunting,and migration,which enable the framework to make dynamic adjustments to enhance the predictions.The framework’s efficacy is evaluated using benchmark datasets,where the proposed work achieves 99.2%accuracy and minimizes the prediction deviation value by up to 2.5%compared to other methods.With the new framework,there was a more accurate prediction of realtime congestion,lower computational cost,and improved regulation of traffic flow.This system is easily implemented in intelligent transportation systems,smart cities,and self-driving cars,providing a robust and scalable solution for future traffic management.
基金supported by the National Key Research and Development Program of China under Grant No.2022YFB2902501the Fundamental Research Funds for the Central Universities under Grant No.2023ZCJH09the Haidian District Golden Bridge Seed Fund of Beijing Municipality under Grant No.S2024161.
文摘In recent years,load balancing routing al-gorithms have been extensively studied in satellite net-works.Most existing studies focus on path selection and hop-count optimization for end-to-end transmis-sion,while overlooking congestion issues on feeder links caused by the limited number and centralized distribution of ground stations.Hence,a multi-service routing algorithm called the Multi-service Load Bal-ancing Routing Algorithm for Traffic Return(MLB-TR)is proposed.Unlike traditional approaches,MLB-TR aims to achieve a broader and more comprehensive load balancing objective.Specifically,based on the service type,an appropriate landing satellite is first selected by considering factors such as shortest path hop count and satellite load.Then,a set of candidate paths from the source satellite to the selected landing satellite is computed.Finally,using the regional load balancing index as the optimization objective,the final transmission path is selected from the candidate path set.Simulation results show that the proposed algo-rithm outperforms the existing works.
基金supported by the National Natural Science Foundation of China,Grant/Award Number:62401338by the Shandong Province Excellent Youth Science Fund Project(Overseas),Grant/Award Number:2024HWYQ-028by the Fundamental Research Funds of Shandong University.
文摘Urban traffic prediction with high precision is always the unremitting pursuit of intelligent transportation systems and is instrumental in bringing smart cities into reality.The fundamental challenges for traffic prediction lie in the accurate modelling of spatial and temporal traffic dynamics.Existing approaches mainly focus on modelling the traffic data itself,but do not explore the traffic correlations implicit in origin-destination(OD)data.In this paper,we propose STOD-Net,a dynamic spatial-temporal OD feature-enhanced deep network,to simultaneously predict the in-traffic and out-traffic for each and every region of a city.We model the OD data as dynamic graphs and adopt graph neural networks in STOD-Net to learn a low-dimensional representation for each region.As per the region feature,we design a gating mechanism and operate it on the traffic feature learning to explicitly capture spatial correlations.To further capture the complicated spatial and temporal dependencies among different regions,we propose a novel joint feature,learning block in STOD-Net and transfer the hybrid OD features to each block to make the learning process spatiotemporal-aware.We evaluate the effectiveness of STOD-Net on two benchmark datasets,and experimental results demonstrate that it outperforms the state-of-the-art by approximately 5%in terms of prediction accuracy and considerably improves prediction stability up to 80%in terms of standard deviation.
基金supported by the National Natural Science Foundation of China(NSFC)under grant No.62371187the Hunan Provincial Natural Science Foundation of China under Grant Nos.2024JJ8309 and 2023JJ50495.
文摘The integration of cloud computing into traditional industrial control systems is accelerating the evolution of Industrial Cyber-Physical System(ICPS),enhancing intelligence and autonomy.However,this transition also expands the attack surface,introducing critical security vulnerabilities.To address these challenges,this article proposes a hybrid intrusion detection scheme for securing ICPSs that combines system state anomaly and network traffic anomaly detection.Specifically,an improved variation-Bayesian-based noise covariance-adaptive nonlinear Kalman filtering(IVB-NCA-NLKF)method is developed to model nonlinear system dynamics,enabling optimal state estimation in multi-sensor ICPS environments.Intrusions within the physical sensing system are identified by analyzing residual discrepancies between predicted and observed system states.Simultaneously,an adaptive network traffic anomaly detection mechanism is introduced,leveraging learned traffic patterns to detect node-and network-level anomalies through pattern matching.Extensive experiments on a simulated network control system demonstrate that the proposed framework achieves higher detection accuracy(92.14%)with a reduced false alarm rate(0.81%).Moreover,it not only detects known attacks and vulnerabilities but also uncovers stealthy attacks that induce system state deviations,providing a robust and comprehensive security solution for the safety protection of ICPS.
基金supported by the National Key Research and Development Program of China No.2023YFB2705000.
文摘With the rise of encrypted traffic,traditional network analysis methods have become less effective,leading to a shift towards deep learning-based approaches.Among these,multimodal learning-based classification methods have gained attention due to their ability to leverage diverse feature sets from encrypted traffic,improving classification accuracy.However,existing research predominantly relies on late fusion techniques,which hinder the full utilization of deep features within the data.To address this limitation,we propose a novel multimodal encrypted traffic classification model that synchronizes modality fusion with multiscale feature extraction.Specifically,our approach performs real-time fusion of modalities at each stage of feature extraction,enhancing feature representation at each level and preserving inter-level correlations for more effective learning.This continuous fusion strategy improves the model’s ability to detect subtle variations in encrypted traffic,while boosting its robustness and adaptability to evolving network conditions.Experimental results on two real-world encrypted traffic datasets demonstrate that our method achieves a classification accuracy of 98.23% and 97.63%,outperforming existing multimodal learning-based methods.
