Optimal design of traffic signal controller using neural networks and fuzzy logic systems

This paper aims at optimally adjusting a set of green times for traffic lights in a single intersection with the purpose of minimizing travel delay time and traffic congestion. Neural network (NN) and fuzzy logic system (FLS) are two methods applied to develop intelligent traffic timing controller. For this purpose, an intersection is considered and simulated as an intelligent agent that learns how to set green times in each cycle based on the traffic information. The training approach and data for both these learning methods are similar. Both methods use genetic algorithm to tune their parameters during learning. Finally, The performance of the two intelligent learning methods is compared with the performance of simple fixed-time method. Simulation results indicate that both intelligent methods significantly reduce the total delay in the network compared to the fixed-time method.

Optimal fuzzy traffic signal controller for an isolated intersection

  This paper aims at optimally adjusting a set of green times for traffic lights in a single intersection with the purpose of minimizing travel delay time and traffic congestion. Fuzzy logic system (FLS) is the method applied to develop the intelligent traffic timing controller. For this purpose, an intersection is considered and simulated as an intelligent agent that learns how to set green times in each cycle based on the traffic information. The FLS controller (FLC) uses genetic algorithm to tune its parameters during learning phase. Finally, The performance of the intelligent FLC is compared with the performance of a FLC with predefined parameters and three simple fixed-time controller. Simulation results indicate that intelligent FLC significantly reduces the total delay in the network compared to the fixed-time method and FLC with manual parameter setting.

Internet traffic classification using constrained clustering

Statistics-based Internet traffic classification using machine learning techniques has attracted extensive research interest lately, because of the increasing ineffectiveness of traditional port-based and payload-based approaches. In particular, unsupervised learning, that is, traffic clustering, is very important in real-life applications, where labeled training data are difficult to obtain and new patterns keep emerging. Although previous studies have applied some classic clustering algorithms such as K-Means and EM for the task, the quality of resultant traffic clusters was far from satisfactory. In order to improve the accuracy of traffic clustering, we propose a constrained clustering scheme that makes decisions with consideration of some background information in addition to the observed traffic statistics. Specifically, we make use of equivalence set constraints indicating that particular sets of flows are using the same application layer protocols, which can be efficiently inferred from packet headers according to the background knowledge of TCP/IP networking. We model the observed data and constraints using Gaussian mixture density and adapt an approximate algorithm for the maximum likelihood estimation of model parameters. Moreover, we study the effects of unsupervised feature discretization on traffic clustering by using a fundamental binning method. A number of real-world Internet traffic traces have been used in our evaluation, and the results show that the proposed approach not only improves the quality of traffic clusters in terms of overall accuracy and per-class metrics, but also speeds up the convergence.

Dividing traffic sub-areas based on a parallel K-means algorithm

In order to alleviate the traffic congestion and reduce the complexity of traffic control and management, it is necessary to exploit traffic sub-areas division which should be effective in planing traffic. Some researchers applied the K-Means algorithm to divide traffic sub-areas on the taxi trajectories. However, the traditional K-Means algorithms faced difficulties in processing large-scale Global Position System(GPS) trajectories of taxicabs with the restrictions of memory, I/O, computing performance. This paper proposes a Parallel Traffic Sub-Areas Division(PTSD) method which consists of two stages, on the basis of the Parallel K-Means(PKM) algorithm. During the first stage, we develop a process to cluster traffic sub-areas based on the PKM algorithm. Then, the second stage, we identify boundary of traffic sub-areas on the base of cluster result. According to this method, we divide traffic sub-areas of Beijing on the real-word (GPS) trajectories of taxicabs. The experiment and discussion show that the method is effective in dividing traffic sub-areas.

On addressing the imbalance problem : A correlated KNN approach for network traffic classification

With the arrival of big data era, the Internet traffic is growing exponentially. A wide variety of applications arise on the Internet and traffic classification is introduced to help people manage the massive applications on the Internet for security monitoring and quality of service purposes. A large number of Machine Learning (ML) algorithms are introduced to deal with traffic classification. A significant challenge to the classification performance comes from imbalanced distribution of data in traffic classification system. In this paper, we proposed an Optimised Distance-based Nearest Neighbor (ODNN), which has the capability of improving the classification performance of imbalanced traffic data. We analyzed the proposed ODNN approach and its performance benefit from both theoretical and empirical perspectives. A large number of experiments were implemented on the real-world traffic dataset. The results show that the performance of “small classes” can be improved significantly even only with small number of training data and the performance of “large classes” remains stable.

Internet traffic clustering with side information

Internet traffic classification is a critical and essential functionality for network management and security systems. Due to the limitations of traditional port-based and payload-based classification approaches, the past several years have seen extensive research on utilizing machine learning techniques to classify Internet traffic based on packet and flow level characteristics. For the purpose of learning from unlabeled traffic data, some classic clustering methods have been applied in previous studies but the reported accuracy results are unsatisfactory. In this paper, we propose a semi-supervised approach for accurate Internet traffic clustering, which is motivated by the observation of widely existing partial equivalence relationships among Internet traffic flows. In particular, we formulate the problem using a Gaussian Mixture Model (GMM) with set-based equivalence constraint and propose a constrained Expectation Maximization (EM) algorithm for clustering. Experiments with real-world packet traces show that the proposed approach can significantly improve the quality of resultant traffic clusters. © 2014 Elsevier Inc.

Attributions of responsibility for motor vehicle accidents and post-injury outcomes.

 This thesis explored the relationship between attributions of responsibility for motor vehicle accidents and post-injury outcomes among a large sample of TAC clients. Results demonstrated that, despite similar levels of physical injury, people who attribute responsibility for accidents to other persons or circumstances experience poorer physical and mental health recovery in comparison to those who attribute responsibility to themselves.

A review on computational intelligence methods for controlling traffic signal timing

Urban traffic as one of the most important challenges in modern city life needs practically effective and efficient solutions. Artificial intelligence methods have gained popularity for optimal traffic light control. In this paper, a review of most important works in the field of controlling traffic signal timing, in particular studies focusing on Q-learning, neural network, and fuzzy logic system are presented. As per existing literature, the intelligent methods show a higher performance compared to traditional controlling methods. However, a study that compares the performance of different learning methods is not published yet. In this paper, the aforementioned computational intelligence methods and a fixed-time method are implemented to set signals times and minimize total delays for an isolated intersection. These methods are developed and compared on a same platform. The intersection is treated as an intelligent agent that learns to propose an appropriate green time for each phase. The appropriate green time for all the intelligent controllers are estimated based on the received traffic information. A comprehensive comparison is made between the performance of Q-learning, neural network, and fuzzy logic system controller for two different scenarios. The three intelligent learning controllers present close performances with multiple replication orders in two scenarios. On average Q-learning has 66%, neural network 71%, and fuzzy logic has 74% higher performance compared to the fixed-time controller.

Intelligent cuckoo search optimized traffic signal controllers for multi-intersection network

Traffic congestion in urban roads is one of the biggest challenges of 21 century. Despite a myriad of research work in the last two decades, optimization of traffic signals in network level is still an open research problem. This paper for the first time employs advanced cuckoo search optimization algorithm for optimally tuning parameters of intelligent controllers. Neural Network (NN) and Adaptive Neuro-Fuzzy Inference System (ANFIS) are two intelligent controllers implemented in this study. For the sake of comparison, we also implement Q-learning and fixed-time controllers as benchmarks. Comprehensive simulation scenarios are designed and executed for a traffic network composed of nine four-way intersections. Obtained results for a few scenarios demonstrate the optimality of trained intelligent controllers using the cuckoo search method. The average performance of NN, ANFIS, and Q-learning controllers against the fixed-time controller are 44%, 39%, and 35%, respectively.

Do the numbers and locations of road-killed anuran carcasses accurately reflect impacts of vehicular traffic?

Road-killed animals are easy and inexpensive to survey, and may provide information about species distributions, abundances, and mortality rates. As with any sampling method, however, we need to explore methodological biases in such data. First, how does an animal's behavior (e.g., use of the center vs. periphery of the road) influence its vulnerability to vehicular traffic? Second, how rapidly do post-mortem processes (scavenging by other animals, destruction or displacement by subsequent vehicles) change the numbers and locations of roadkills? Our surveys of anurans on a highway in tropical Australia show that different anuran species are distributed in different ways across the width of the road, and that locations of live versus dead animals sometimes differ within a species. Experimental trials show that location on the road affects the probability of being hit by a vehicle, with anurans in the middle of the road begin hit 35% more often than anurans on the edges; thus, center-using species are more likely to be hit than edge-using taxa. The magnitude of post-mortem displacement and destruction by subsequent vehicles depended on anuran species and body size. The mean parallel displacement distance was 122.7 cm, and carcasses of thin-skinned species exhibited greater post-mortem destruction. Scavenging raptors removed 73% of carcasses, most within a few hours of sunrise. Removal rates were biased with respect to size and species. Overall, our studies suggest that investigators should carefully evaluate potential biases before using roadkill counts to estimate underlying animal abundances or mortality rates.

Association between perception of fault for the crash and function, return to work and health status 1 year after road traffic injury: a registry-based cohort study

Objectives To establish the association between the patient's perception of fault for the crash and 12-month outcomes after non-fatal road traffic injury.Setting Two adult major trauma centres, one regional trauma centre and one metropolitan trauma centre in Victoria, Australia.Participants 2605 adult, orthopaedic trauma patients covered by the state's no-fault third party insurer for road traffic injury, injured between September 2010 and February 2014.Outcome measures EQ-5D-3L, return to work and functional recovery (Glasgow Outcome Scale—Extended score of upper good recovery) at 12 months postinjury.Results After adjusting for key confounders, the adjusted relative risk (ARR) of a functional recovery (0.57, 95% CI 0.46 to 0.69) and return to work (0.92, 95% CI 0.86 to 0.99) were lower for the not at fault compared to the at fault group. The ARR of reporting problems on EQ-5D items was 1.20–1.35 times higher in the not at fault group. Conclusions Patients who were not at fault, or denied being at fault despite a police report of fault, experienced poorer outcomes than the at fault group. Attributing fault to others was associated with poorer outcomes. Interventions to improve coping, or to resolve negative feelings from the crash, could facilitate better outcomes in the future.

Aggregation on the fly: Reducing traffic for big data in the cloud

As a leading framework for processing and analyzing big data, MapReduce is leveraged by many enterprises to parallelize their data processing on distributed computing systems. Unfortunately, the all-to-all data forwarding from map tasks to reduce tasks in the traditional MapReduce framework would generate a large amount of network traffic. The fact that the intermediate data generated by map tasks can be combined with significant traffic reduction in many applications motivates us to propose a data aggregation scheme for MapReduce jobs in cloud. Specifically, we design an aggregation architecture under the existing MapReduce framework with the objective of minimizing the data traffic during the shuffle phase, in which aggregators can reside anywhere in the cloud. Some experimental results also show that our proposal outperforms existing work by reducing the network traffic significantly.

Joint optimization of rule placement and traffic engineering for QoS provisioning in software defined network

Software-Defined Network (SDN) is a promising network paradigm that separates the control plane and data plane in the network. It has shown great advantages in simplifying network management such that new functions can be easily supported without physical access to the network switches. However, Ternary Content Addressable Memory (TCAM), as a critical hardware storing rules for high-speed packet processing in SDN-enabled devices, can be supplied to each device with very limited quantity because it is expensive and energy-consuming. To efficiently use TCAM resources, we propose a rule multiplexing scheme, in which the same set of rules deployed on each node apply to the whole flow of a session going through but towards different paths. Based on this scheme, we study the rule placement problem with the objective of minimizing rule space occupation for multiple unicast sessions under QoS constraints. We formulate the optimization problem jointly considering routing engineering and rule placement under both existing and our rule multiplexing schemes. Via an extensive review of the state-of-the-art work, to the best of our knowledge, we are the first to study the non-routing-rule placement problem. Finally, extensive simulations are conducted to show that our proposals significantly outperform existing solutions.

Robust network traffic classification

As a fundamental tool for network management and security, traffic classification has attracted increasing attention in recent years. A significant challenge to the robustness of classification performance comes from zero-day applications previously unknown in traffic classification systems. In this paper, we propose a new scheme of Robust statistical Traffic Classification (RTC) by combining supervised and unsupervised machine learning techniques to meet this challenge. The proposed RTC scheme has the capability of identifying the traffic of zero-day applications as well as accurately discriminating predefined application classes. In addition, we develop a new method for automating the RTC scheme parameters optimization process. The empirical study on real-world traffic data confirms the effectiveness of the proposed scheme. When zero-day applications are present, the classification performance of the new scheme is significantly better than four state-of-the-art methods: random forest, correlation-based classification, semi-supervised clustering, and one-class SVM.

Design of an optimal ANFIS traffic signal controller by using cuckoo search for an isolated intersection

An optimal design of Adaptive Neuro-Fuzzy Inference System (ANFIS) traffic signal controller is presented in this paper. The proposed controller aims to adjust a set of green times for traffic lights in a single intersection with the purpose of minimizing travel delay time and traffic congestion. The ANFIS controller is trained, to learned how to set green times for each traffic phase. This intelligent controller uses the Cuckoo Search (CS) algorithm to tune its parameters during the learning pried. Evaluating the performance of the proposed controller in comparison with the performance of a FLS controller (FLC) with predefined rules and membership functions, and also three fixed-Time controllers, illustrates the better performance of the optimal ANFIS controller against the other benchmark controllers.