Urban Traffic Control Meets Decision Recommendation System:A Survey and Perspective

Urban traffic control is a multifaceted and demanding task that necessitates extensive decision-making to ensure the safety and efficiency of urban transportation systems.Traditional approaches require traffic signal professionals to manually intervene on traffic control devices at the intersection level,utilizing their knowledge and expertise.However,this process is cumbersome,labor-intensive,and cannot be applied on a large network scale.Recent studies have begun to explore the applicability of recommendation system for urban traffic control,which offer increased control efficiency and scalability.Such a decision recommendation system is complex,with various interdependent components,but a systematic literature review has not yet been conducted.In this work,we present an up-to-date survey that elucidates all the detailed components of a recommendation system for urban traffic control,demonstrates the utility and efficacy of such a system in the real world using data and knowledgedriven approaches,and discusses the current challenges and potential future directions of this field.

On the critical conditions of traffic jams

Traffic wave theory is used to study the critical conditions for traffic jams according to their features. First, the characteristics of traffic wave propagation is analyzed for the simple signal-controlled lane and the critical conditions for oversaturation is established. Then, the basic road is decomposed into a series of one-way links according to its topological characteristics. Based on the decomposition, traffic wave propagation under complex conditions is studied. Three complicated factors are considered to establish the corresponding critical conditions of jam formation, namely, dynamic and insufficient split, channelized section spillover and endogenous traffic flow. The results show that road geometric features, traffic demand structures and signal settings influence the formation and propagation of traffic congestion. These findings can serve as a theoretical basis for future network jam control.

Classified VPN Network Traffic Flow Using Time Related to Artificial Neural Network

VPNs are vital for safeguarding communication routes in the continually changing cybersecurity world.However,increasing network attack complexity and variety require increasingly advanced algorithms to recognize and categorizeVPNnetwork data.We present a novelVPNnetwork traffic flowclassificationmethod utilizing Artificial Neural Networks(ANN).This paper aims to provide a reliable system that can identify a virtual private network(VPN)traffic fromintrusion attempts,data exfiltration,and denial-of-service assaults.We compile a broad dataset of labeled VPN traffic flows from various apps and usage patterns.Next,we create an ANN architecture that can handle encrypted communication and distinguish benign from dangerous actions.To effectively process and categorize encrypted packets,the neural network model has input,hidden,and output layers.We use advanced feature extraction approaches to improve the ANN’s classification accuracy by leveraging network traffic’s statistical and behavioral properties.We also use cutting-edge optimizationmethods to optimize network characteristics and performance.The suggested ANN-based categorization method is extensively tested and analyzed.Results show the model effectively classifies VPN traffic types.We also show that our ANN-based technique outperforms other approaches in precision,recall,and F1-score with 98.79%accuracy.This study improves VPN security and protects against new cyberthreats.Classifying VPNtraffic flows effectively helps enterprises protect sensitive data,maintain network integrity,and respond quickly to security problems.This study advances network security and lays the groundwork for ANN-based cybersecurity solutions.

Spatiotemporal Prediction of Urban Traffics Based on Deep GNN

Traffic prediction already plays a significant role in applications like traffic planning and urban management,but it is still difficult to capture the highly non-linear and complicated spatiotemporal correlations of traffic data.As well as to fulfil both long-termand short-termprediction objectives,a better representation of the temporal dependency and global spatial correlation of traffic data is needed.In order to do this,the Spatiotemporal Graph Neural Network(S-GNN)is proposed in this research as amethod for traffic prediction.The S-GNN simultaneously accepts various traffic data as inputs and investigates the non-linear correlations between the variables.In terms of modelling,the road network is initially represented as a spatiotemporal directed graph,with the features of the samples at the time step being captured by a convolution module.In order to assign varying attention weights to various adjacent area nodes of the target node,the adjacent areas information of nodes in the road network is then aggregated using a graph network.The data is output using a fully connected layer at the end.The findings show that S-GNN can improve short-and long-term traffic prediction accuracy to a greater extent;in comparison to the control model,the RMSE of S-GNN is reduced by about 0.571 to 9.288 and the MAE(Mean Absolute Error)by about 0.314 to 7.678.The experimental results on two real datasets,Pe MSD7(M)and PEMS-BAY,also support this claim.

Impacts of bus holding strategy on the performance and pollutant emissions of a two-lane mixed traffic system

This paper investigates the impacts of a bus holding strategy on the mutual interference between buses and passenger cars in a non-dedicated bus route,as well as the impacts on the characteristics of pollutant emissions of passenger cars.The dynamic behaviors of these two types of vehicles are described using cellular automata(CA)models under open boundary conditions.Numerical simulations are carried out to obtain the phase diagrams of the bus system and the trajectories of buses and passenger cars before and after the implementation of the bus holding strategy under different probabilities of passenger cars entering a two-lane mixed traffic system.Then,we analyze the flow rate,satisfaction rate,and pollutant emission rates of passenger cars together with the performance of a mixed traffic system.The results show that the bus holding strategy can effectively alleviate bus bunching,whereas it has no significant impact on the flow rate and pollutant emission rates of passenger cars;the flow rate,satisfaction rate,and pollutant emission rates of passenger cars for either the traffic system or for each lane are influenced by the bus departure interval and the number of passengers arriving at bus stops.

Segment routing for traffic engineering and effective recovery in low-earth orbit satellite constellations

Low-Earth Orbit Satellite Constellations(LEO-SCs)provide global,high-speed,and low latency Internet access services,which bridges the digital divide in the remote areas.As inter-satellite links are not supported in initial deployment(i.e.the Starlink),the communication between satellites is based on ground stations with radio frequency signals.Due to the rapid movement of satellites,this hybrid topology of LEO-SCs and ground stations is time-varying,which imposes a major challenge to uninterrupted service provisioning and network management.In this paper,we focus on solving two notable problems in such a ground station-assisted LEO-SC topology,i.e.,traffic engineering and fast reroute,to guarantee that the packets are forwarded in a balanced and uninterrupted manner.Specifically,we employ segment routing to support the arbitrary path routing in LEO-SCs.To solve the traffic engineering problem,we proposed two source routings with traffic splitting algorithms,Delay-Bounded Traffic Splitting(DBTS)and DBTS+,where DBTS equally splits a flow and DBTS+favors shorter paths.Simu-lation results show that DBTS+can achieve about 30%lower maximum satellite load at the cost of about 10%more delay.To guarantee the fast recovery of failures,two fast reroute mechanisms,Loop-Free Alternate(LFA)and LFA+,are studied,where LFA pre-computes an alternate next-hop as a backup while LFA+finds a 2-segment backup path.We show that LFA+can increase the percentage of protection coverage by about 15%.

Network Traffic Synthesis and Simulation Framework for Cybersecurity Exercise Systems

In the rapidly evolving field of cybersecurity,the challenge of providing realistic exercise scenarios that accurately mimic real-world threats has become increasingly critical.Traditional methods often fall short in capturing the dynamic and complex nature of modern cyber threats.To address this gap,we propose a comprehensive framework designed to create authentic network environments tailored for cybersecurity exercise systems.Our framework leverages advanced simulation techniques to generate scenarios that mirror actual network conditions faced by professionals in the field.The cornerstone of our approach is the use of a conditional tabular generative adversarial network(CTGAN),a sophisticated tool that synthesizes realistic synthetic network traffic by learning fromreal data patterns.This technology allows us to handle technical components and sensitive information with high fidelity,ensuring that the synthetic data maintains statistical characteristics similar to those observed in real network environments.By meticulously analyzing the data collected from various network layers and translating these into structured tabular formats,our framework can generate network traffic that closely resembles that found in actual scenarios.An integral part of our process involves deploying this synthetic data within a simulated network environment,structured on software-defined networking(SDN)principles,to test and refine the traffic patterns.This simulation not only facilitates a direct comparison between the synthetic and real traffic but also enables us to identify discrepancies and refine the accuracy of our simulations.Our initial findings indicate an error rate of approximately 29.28%between the synthetic and real traffic data,highlighting areas for further improvement and adjustment.By providing a diverse array of network scenarios through our framework,we aim to enhance the exercise systems used by cybersecurity professionals.This not only improves their ability to respond to actual cyber threats but also ensures that the exercise is cost-effective and efficient.

HGNN-ETC: Higher-Order Graph Neural Network Based on Chronological Relationships for Encrypted Traffic Classification

Encrypted traffic plays a crucial role in safeguarding network security and user privacy.However,encrypting malicious traffic can lead to numerous security issues,making the effective classification of encrypted traffic essential.Existing methods for detecting encrypted traffic face two significant challenges.First,relying solely on the original byte information for classification fails to leverage the rich temporal relationships within network traffic.Second,machine learning and convolutional neural network methods lack sufficient network expression capabilities,hindering the full exploration of traffic’s potential characteristics.To address these limitations,this study introduces a traffic classification method that utilizes time relationships and a higher-order graph neural network,termed HGNN-ETC.This approach fully exploits the original byte information and chronological relationships of traffic packets,transforming traffic data into a graph structure to provide the model with more comprehensive context information.HGNN-ETC employs an innovative k-dimensional graph neural network to effectively capture the multi-scale structural features of traffic graphs,enabling more accurate classification.We select the ISCXVPN and the USTC-TK2016 dataset for our experiments.The results show that compared with other state-of-the-art methods,our method can obtain a better classification effect on different datasets,and the accuracy rate is about 97.00%.In addition,by analyzing the impact of varying input specifications on classification performance,we determine the optimal network data truncation strategy and confirm the model’s excellent generalization ability on different datasets.

Optimization Model Proposal for Traffic Differentiation in Wireless Sensor Networks

Wireless sensor networks(WSNs)are characterized by heterogeneous traffic types(audio,video,data)and diverse application traffic requirements.This paper introduces three traffic classes following the defined model of heterogeneous traffic differentiation in WSNs.The requirements for each class regarding sensitivity to QoS(Quality of Service)parameters,such as loss,delay,and jitter,are described.These classes encompass real-time and delay-tolerant traffic.Given that QoS evaluation is a multi-criteria decision-making problem,we employed the AHP(Analytical Hierarchy Process)method for multi-criteria optimization.As a result of this approach,we derived weight values for different traffic classes based on key QoS factors and requirements.These weights are assigned to individual traffic classes to determine transmission priority.This study provides a thorough comparative analysis of the proposed model against existing methods,demonstrating its superior performance across various traffic scenarios and its implications for future WSN applications.The results highlight the model’s adaptability and robustness in optimizing network resources under varying conditions,offering insights into practical deployments in real-world scenarios.Additionally,the paper includes an analysis of energy consumption,underscoring the trade-offs between QoS performance and energy efficiency.This study presents the development of a differentiated services model for heterogeneous traffic in wireless sensor networks,considering the appropriate QoS framework supported by experimental analyses.

Real-Time Prediction of Urban Traffic Problems Based on Artificial Intelligence-Enhanced Mobile Ad Hoc Networks(MANETS)

Traffic in today’s cities is a serious problem that increases travel times,negatively affects the environment,and drains financial resources.This study presents an Artificial Intelligence(AI)augmentedMobile Ad Hoc Networks(MANETs)based real-time prediction paradigm for urban traffic challenges.MANETs are wireless networks that are based on mobile devices and may self-organize.The distributed nature of MANETs and the power of AI approaches are leveraged in this framework to provide reliable and timely traffic congestion forecasts.This study suggests a unique Chaotic Spatial Fuzzy Polynomial Neural Network(CSFPNN)technique to assess real-time data acquired from various sources within theMANETs.The framework uses the proposed approach to learn from the data and create predictionmodels to detect possible traffic problems and their severity in real time.Real-time traffic prediction allows for proactive actions like resource allocation,dynamic route advice,and traffic signal optimization to reduce congestion.The framework supports effective decision-making,decreases travel time,lowers fuel use,and enhances overall urban mobility by giving timely information to pedestrians,drivers,and urban planners.Extensive simulations and real-world datasets are used to test the proposed framework’s prediction accuracy,responsiveness,and scalability.Experimental results show that the suggested framework successfully anticipates urban traffic issues in real-time,enables proactive traffic management,and aids in creating smarter,more sustainable cities.

Analysis of Traffic Accidents in Vietnam

Understanding the causes and solutions of road traffic accidents is important for developing road and action plans in a country. In Vietnam, awareness of traffic participants is the main cause of serious traffic accidents. In recent years, the number of road traffic accidents in Tuyen Quang province with deaths has decreased, but the number of accidents has increased significantly. The article uses data on traffic accidents in Tuyen Quang over the (2016-2023) has been analytically reviewed. From there, analyze accident characteristics and causes of traffic accidents in Tuyen Quang province, and propose solutions to improve traffic safety in Tuyen Quang, Vietnam. The findings can be information for managers and researchers interested in studying the province of Tuyen Quang, Vietnam road traffic safety. Additionally, the findings have led the government to achieve national targets in reducing the number of accidents and serious injuries.

Multi-Head Attention Spatial-Temporal Graph Neural Networks for Traffic Forecasting

Accurate traffic prediction is crucial for an intelligent traffic system (ITS). However, the excessive non-linearity and complexity of the spatial-temporal correlation in traffic flow severely limit the prediction accuracy of most existing models, which simply stack temporal and spatial modules and fail to capture spatial-temporal features effectively. To improve the prediction accuracy, a multi-head attention spatial-temporal graph neural network (MSTNet) is proposed in this paper. First, the traffic data is decomposed into unique time spans that conform to positive rules, and valuable traffic node attributes are mined through an adaptive graph structure. Second, time and spatial features are captured using a multi-head attention spatial-temporal module. Finally, a multi-step prediction module is used to achieve future traffic condition prediction. Numerical experiments were conducted on an open-source dataset, and the results demonstrate that MSTNet performs well in spatial-temporal feature extraction and achieves more positive forecasting results than the baseline methods.

From rectangle to parallelogram:an area-weighted method to make time-space diagrams incorporate traffic waves

A time-space(TS)traffic diagram is one of the most important tools for traffic visualization and analysis.Recently,it has been empirically shown that using parallelogram cells to construct a TS diagram outperforms using rectangular cells due to its incorporation of traffic wave speed.However,it is not realistic to immediately change the fundamental method of TS diagram construction that has been well embedded in various systems.To quickly make the existing TS diagram incorporate traffic wave speed and exhibit more realistic traffic patterns,the paper proposes an area-weighted transformation method that directly transforms rectangular-cell-based TS(rTS)diagrams into parallelogram-cell-based TS(pTS)diagrams,avoiding tracing back the raw data of speed to make the transformation.Two five-hour trajectory datasets from Japanese highway segments are used to demonstrate the effectiveness of the proposed methods.The travel time-based comparison involves assessing the disparities between actual travel times and those computed using rTS diagrams,as well as travel times derived directly from pTS diagrams based on rTS diagrams.The results show that travel times calculated from pTS diagrams converted from rTS diagrams are closer to the actual values,especially in congested conditions,demonstrating superior performance in parallelogram representation.The proposed transformation method has promising prospects for practical applications,making the widely-existing TS diagrams show more realistic traffic patterns.

Scheme design technique for urban traffic management planning

Management tactics for urban traffic management are presented.The tactics that underlie traffic demand management （TDM） are preferential development tactics, controlled development tactics,prohibited development tactics and economic lever tactics,and those that underlie traffic system management （TSM） are node traffic management tactics,arterial traffic management tactics and area traffic management tactics.The specific contents and design methods of urban traffic total demand control,urban traffic structure optimization,road traffic movement organization based on TDM and intersection traffic management,road signs and markings management,optimized design of traffic signals and management of parking spaces based on TSM are put forward.The urban traffic management planning scheme design method has already been used in the urban traffic management “Smooth Traffic Project” in China.

Network traffic classification:Techniques,datasets,and challenges

In network traffic classification,it is important to understand the correlation between network traffic and its causal application,protocol,or service group,for example,in facilitating lawful interception,ensuring the quality of service,preventing application choke points,and facilitating malicious behavior identification.In this paper,we review existing network classification techniques,such as port-based identification and those based on deep packet inspection,statistical features in conjunction with machine learning,and deep learning algorithms.We also explain the implementations,advantages,and limitations associated with these techniques.Our review also extends to publicly available datasets used in the literature.Finally,we discuss existing and emerging challenges,as well as future research directions.

Applying an Improved Dung Beetle Optimizer Algorithm to Network Traffic Identification

Network traffic identification is critical for maintaining network security and further meeting various demands of network applications.However,network traffic data typically possesses high dimensionality and complexity,leading to practical problems in traffic identification data analytics.Since the original Dung Beetle Optimizer(DBO)algorithm,Grey Wolf Optimization(GWO)algorithm,Whale Optimization Algorithm(WOA),and Particle Swarm Optimization(PSO)algorithm have the shortcomings of slow convergence and easily fall into the local optimal solution,an Improved Dung Beetle Optimizer(IDBO)algorithm is proposed for network traffic identification.Firstly,the Sobol sequence is utilized to initialize the dung beetle population,laying the foundation for finding the global optimal solution.Next,an integration of levy flight and golden sine strategy is suggested to give dung beetles a greater probability of exploring unvisited areas,escaping from the local optimal solution,and converging more effectively towards a global optimal solution.Finally,an adaptive weight factor is utilized to enhance the search capabilities of the original DBO algorithm and accelerate convergence.With the improvements above,the proposed IDBO algorithm is then applied to traffic identification data analytics and feature selection,as so to find the optimal subset for K-Nearest Neighbor(KNN)classification.The simulation experiments use the CICIDS2017 dataset to verify the effectiveness of the proposed IDBO algorithm and compare it with the original DBO,GWO,WOA,and PSO algorithms.The experimental results show that,compared with other algorithms,the accuracy and recall are improved by 1.53%and 0.88%in binary classification,and the Distributed Denial of Service(DDoS)class identification is the most effective in multi-classification,with an improvement of 5.80%and 0.33%for accuracy and recall,respectively.Therefore,the proposed IDBO algorithm is effective in increasing the efficiency of traffic identification and solving the problem of the original DBO algorithm that converges slowly and falls into the local optimal solution when dealing with high-dimensional data analytics and feature selection for network traffic identification.

Network Intrusion Traffic Detection Based on Feature Extraction

With the increasing dimensionality of network traffic,extracting effective traffic features and improving the identification accuracy of different intrusion traffic have become critical in intrusion detection systems(IDS).However,both unsupervised and semisupervised anomalous traffic detection methods suffer from the drawback of ignoring potential correlations between features,resulting in an analysis that is not an optimal set.Therefore,in order to extract more representative traffic features as well as to improve the accuracy of traffic identification,this paper proposes a feature dimensionality reduction method combining principal component analysis and Hotelling’s T^(2) and a multilayer convolutional bidirectional long short-term memory(MSC_BiLSTM)classifier model for network traffic intrusion detection.This method reduces the parameters and redundancy of the model by feature extraction and extracts the dependent features between the data by a bidirectional long short-term memory(BiLSTM)network,which fully considers the influence between the before and after features.The network traffic is first characteristically downscaled by principal component analysis(PCA),and then the downscaled principal components are used as input to Hotelling’s T^(2) to compare the differences between groups.For datasets with outliers,Hotelling’s T^(2) can help identify the groups where the outliers are located and quantitatively measure the extent of the outliers.Finally,a multilayer convolutional neural network and a BiLSTM network are used to extract the spatial and temporal features of network traffic data.The empirical consequences exhibit that the suggested approach in this manuscript attains superior outcomes in precision,recall and F1-score juxtaposed with the prevailing techniques.The results show that the intrusion detection accuracy,precision,and F1-score of the proposed MSC_BiLSTM model for the CIC-IDS 2017 dataset are 98.71%,95.97%,and 90.22%.

BSTFNet:An Encrypted Malicious Traffic Classification Method Integrating Global Semantic and Spatiotemporal Features

While encryption technology safeguards the security of network communications,malicious traffic also uses encryption protocols to obscure its malicious behavior.To address the issues of traditional machine learning methods relying on expert experience and the insufficient representation capabilities of existing deep learning methods for encrypted malicious traffic,we propose an encrypted malicious traffic classification method that integrates global semantic features with local spatiotemporal features,called BERT-based Spatio-Temporal Features Network(BSTFNet).At the packet-level granularity,the model captures the global semantic features of packets through the attention mechanism of the Bidirectional Encoder Representations from Transformers(BERT)model.At the byte-level granularity,we initially employ the Bidirectional Gated Recurrent Unit(BiGRU)model to extract temporal features from bytes,followed by the utilization of the Text Convolutional Neural Network(TextCNN)model with multi-sized convolution kernels to extract local multi-receptive field spatial features.The fusion of features from both granularities serves as the ultimate multidimensional representation of malicious traffic.Our approach achieves accuracy and F1-score of 99.39%and 99.40%,respectively,on the publicly available USTC-TFC2016 dataset,and effectively reduces sample confusion within the Neris and Virut categories.The experimental results demonstrate that our method has outstanding representation and classification capabilities for encrypted malicious traffic.

Effects of real-time traffic information systems on traffic performance under different network structures

The effects of real-time traffic information system(RTTIS)on traffic performance under parallel,grid and ring networks were investigated.The simulation results show that the effects of the proportion of RTTIS usage depend on the road network structures.For traffic on a parallel network,the performance of groups with and without RTTIS level is improved when the proportion of vehicles using RTTIS is greater than 0 and less than 30%,and a proportion of RTTIS usage higher than 90%would actually deteriorate the performance.For both grid and ring networks,a higher proportion of RTTIS usage always improves the performance of groups with and without RTTIS.For all three network structures,vehicles without RTTIS benefit from some proportion of RTTIS usage in a system.

En-route Sector Complexity Control Strategies in Air Traffic Management

Along with the rapid development of air traffic, the contradiction between conventional air traffic management(ATM)and the increasingly complex air traffic situations is more severe,which essentially reduces the operational efficiency of air transport systems. Thus,objectively measuring the air traffic situation complexity becomes a concern in the field of ATM. Most existing studies focus on air traffic complexity assessment,and rarely on the scientific guidance of complex traffic situations. According to the projected time of aircraft arriving at the target sector boundary,we formulated two control strategies to reduce the air traffic complexity. The strategy of entry time optimization was applied to the controllable flights in the adjacent upstream sectors. In contrast,the strategy of flying dynamic speed optimization was applied to the flights in the target sector. During the process of solving complexity control models,we introduced a physical programming method. We transformed the multi-objective optimization problem involving complexity and delay to single-objective optimization problems by designing different preference function. Actual data validated the two complexity control strategies can eliminate the high-complexity situations in reality. The control strategy based on the entry time optimization was more efficient than that based on the speed dynamic optimization. A basic framework for studying air traffic complexity management was preliminarily established. Our findings will help the implementation of a complexity-based ATM.